[Paper Review] Forbidden Minors For 3-Connected Graphs With No Non-Splitting 5-Configurations

Iain Crump|arXiv (Cornell University)|Dec 6, 2013

Advanced Topics in Algebra21 references3 citations

TL;DR

This paper identifies the complete set of forbidden minors for simple 3-connected graphs that split for all 5-configurations—key in understanding the denominator reducibility of Feynman integrals in quantum field theory. Using graph minor theory and Dodgson polynomial invariants, it proves that $K_5$, $K_{3,3}$, the octahedron, the cube, and the $ riangle$-Y transform of the cube are the only such forbidden minors, establishing a finite obstruction set for 3-connected graphs.

ABSTRACT

For a set of five edges, a graph splits if one of the associated Dodgson polynomials is equal to zero. A graph G splitting for every set of five edges is a minor-closed property. As such there is a finite set of forbidden minors F such that if a graph H does not contain a minor isomorphic to any graph in F, then H splits. In this paper we prove that if a graph G is simple, 3-connected, and splits, then G must not contain any minors isomorphic to K5, K3,3, the octahedron, the cube, or a graph that is a single delta-Y transformation away from the cube. As such this is the set of all simple 3-connected forbidden minors. The complete set of 2-connected or non-simple forbidden minors remains unresolved, though a number have been found.

Motivation & Objective

• To determine the complete set of forbidden minors for simple 3-connected graphs that split under all 5-configurations.
• To establish a finite obstruction set for 3-connected graphs that are denominator reducible in the context of massless quantum field theory.
• To resolve the structure of minor-minimal non-splitting 5-configurations in 3-connected graphs using graph minor theory and $ riangle$-Y transformations.
• To clarify the role of $K_5$, $K_{3,3}$, the octahedron, the cube, and their $ riangle$-Y variants as the sole forbidden minors in the 3-connected, simple case.

Proposed method

• Applied graph minor theory to identify a finite obstruction set for the minor-closed property of splitting under all 5-configurations.
• Used Dodgson polynomials and five-invariants to characterize when a 5-edge configuration splits in a graph.
• Analyzed the effect of $ riangle$-Y and $Y$-$ riangle$ transformations on non-splitting configurations, showing invariance under such operations.
• Employed full component constructions and two-vertex cut analysis to reduce the problem to 3-connected graphs.
• Proved that graphs with bridges or degree-2 vertices cannot be primitive divergent, eliminating them as candidates for minor-minimal non-splitting graphs.
• Used duality and minor-minimality arguments to verify that only five specific graphs—$K_5$, $K_{3,3}$, octahedron, cube, and its $ riangle$-Y transform—serve as forbidden minors.

Experimental results

Research questions

• RQ1 What is the complete set of forbidden minors for simple 3-connected graphs that split under all 5-configurations?
• RQ2 Are the graphs $K_5$, $K_{3,3}$, the octahedron, the cube, and the $ riangle$-Y transform of the cube the only minor-minimal non-splitting graphs in the 3-connected, simple case?
• RQ3 How do $ riangle$-Y transformations affect the splitting behavior of 5-configurations in a graph?
• RQ4 Can all non-splitting 5-configurations in 3-connected graphs be reduced to known minor-minimal obstructions?
• RQ5 Is the list of forbidden minors complete for 3-connected, simple graphs, and what remains open for 2-connected or non-simple graphs?

Key findings

• The complete set of forbidden minors for simple 3-connected graphs with no non-splitting 5-configurations consists of $K_5$, $K_{3,3}$, the octahedron, the cube, and the graph obtained by a single $ riangle$-Y transformation from the cube.
• Any minor-minimal non-splitting 5-configuration in a 3-connected graph must be isomorphic to one of these five graphs.
• Graphs with bridges or degree-2 vertices cannot be primitive divergent and thus cannot be minor-minimal non-splitting.
• The $ riangle$-Y transformation preserves non-splitting behavior for 5-configurations not involving the transformed edges, enabling structural classification.
• The residue of a Feynman integral for a graph with a two-vertex cut factors into residues of its 3-connected components, justifying focus on 3-connected graphs.
• The open problem remains to classify all 2-connected or non-simple forbidden minors, though several such graphs have been identified.