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

DOI10.1016/J.DISC.2014.10.001MaRDI QIDQ482194zbMATH OpenOpenAlexFDO

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

Publication date 19 December 2014

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

forbidden minorsFeynman graphs5-invariant

Mathematics Subject Classification ID

Connectivity (05C40) Graph minors (05C83)

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.

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

Cites work

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

Cited in

(2)

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

Describes a project that uses

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)