Forbidden minors for graphs with no first obstruction to parametric Feynman integration

DOI10.1016/J.DISC.2014.10.001zbMATH Open1305.05214arXiv1310.5788OpenAlexW2067247085MaRDI QIDQ482194FDOQ482194

Authors: Samson Black, Iain Crump, Matt DeVos, Karen Yeats 

Publication date: 19 December 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We give a characterization of 3-connected graphs which are planar and forbid cube, octahedron, and $H$ minors, where $H$ is the graph which is one $Delta-Y$ away from each of the cube and the octahedron. Next we say a graph is Feynman 5-split if no choice of edge ordering gives an obstruction to parametric Feynman integration at the fifth step. The 3-connected Feynman 5-split graphs turn out to be precisely those characterized above. Finally we derive the full list of forbidden minors for Feynman 5-split graphs of any connectivity.

Full work available at URL: https://arxiv.org/abs/1310.5788

Recommendations

• Graph minors and the linear reducibility of Feynman diagrams
• Forbidden minors to graphs with small feedback sets
• On the geometry of graphs with a forbidden minor
• scientific article; zbMATH DE number 4144031
• Graph complexes and Feynman rules
• scientific article; zbMATH DE number 4122040
• The Feynman identity for planar graphs
• Bounds on completely convergent Euclidean Feynman graphs
• Minimal forbidden subgraphs for the Klein bottle with low connectivity.
• scientific article; zbMATH DE number 3961651

zbMATH Keywords

forbidden minorsFeynman graphs5-invariant

Mathematics Subject Classification ID

Connectivity (05C40) Graph minors (05C83)

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. XX: Wagner's conjecture
• A characterization of graphs with no cube minor
• A characterization of graphs with no octahedron minor
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• Algorithms and obstructions for linear-width and related search parameters
• Knots and Numbers in ϕ⁴ Theory to 7 Loops and Beyond
• Spanning forest polynomials and the transcendental weight of Feynman graphs
• On motives associated to graph polynomials
• Title not available (Why is that?)
• Quantum periods: a census of \(\phi^4\)-transcendentals
• A \(K3\) in \(\phi^{4}\)
• Quantum field theory over \(\mathbb F_q\)
• Title not available (Why is that?)
• Parametric Feynman integrals and determinant hypersurfaces
• More forbidden minors for wye-delta-wye reducibility
• On 3-connected graphs of path-width at most three
• Some combinatorial interpretations in perturbative quantum field theory
• A linear-time algorithm to compute the reliability of planar cube-free networks
• Properties of \(c_2\) invariants of Feynman graphs

Cited In (2)

• Graph minors and the linear reducibility of Feynman diagrams
• New graph polynomials in parametric QED Feynman integrals

Uses Software

• SageMath

This page was built for publication: Forbidden minors for graphs with no first obstruction to parametric Feynman integration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482194)