Forbidden minors for graphs with no first obstruction to parametric Feynman integration
classification
🧮 math.CO
keywords
feynmangraphsminorssplitconnectedcubeforbiddengraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.