The conjecture that is not reducible for the first Symanzik polynomial
The conjecture that is not reducible for the first Symanzik polynomial
A graph is reducible with respect to the first Symanzik polynomial when it has the corresponding reducibility property for that polynomial. The irreducibility conjecture. The graph is not reducible with respect to the first Symanzik polynomial. This is proposed as a starting point for determining the full forbidden minor set for reducibility with respect to the first Symanzik polynomial; the source gives no resolution.
Sources & referencesView supporting material
Primary source
Benjamin Moore, “Rooted Graph Minors and Reducibility of Graph Polynomials”, arXiv:1704.04701 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.