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

DOI10.1016/J.DISC.2014.10.001zbMath1305.05214arXiv1310.5788OpenAlexW2067247085MaRDI QIDQ482194

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

Graph minors (05C83) Connectivity (05C40)

Related Items (1)

New graph polynomials in parametric QED Feynman integrals

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• A \(K3\) in \(\phi^{4}\)
• Properties of \(c_2\) invariants of Feynman graphs
• Quantum field theory over \(\mathbb F_q\)
• Spanning forest polynomials and the transcendental weight of Feynman graphs
• Parametric Feynman integrals and determinant hypersurfaces
• Graph minors. XX: Wagner's conjecture
• More forbidden minors for wye-delta-wye reducibility
• On motives associated to graph polynomials
• Quantum periods: a census of \(\phi^4\)-transcendentals
• Graph minors. X: Obstructions to tree-decomposition
• Algorithms and obstructions for linear-width and related search parameters
• A characterization of graphs with no cube minor
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• A Characterization of Graphs with No Octahedron Minor
• 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
• Knots and Numbers in ϕ⁴ Theory to 7 Loops and Beyond

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