2000 character limit reached
Forbidden minors for graphs with no first obstruction to parametric Feynman integration
Published 22 Oct 2013 in math.CO | (1310.5788v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.