Tightness conjecture for the rooted K3,3K_{3,3} minor bound

From papers

The preceding theorem gives a bound on rooted K3,3K_{3,3} minors; denote this bound by the quantity appearing in Theorem. Tightness conjecture. The bound in Theorem is tight. This conjecture asserts that the bound cannot be improved and is presented as a possible starting point for determining forbidden minor characterizations related to reducibility. The source does not provide evidence resolving its status.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Benjamin Moore, “Rooted Graph Minors and Reducibility of Graph Polynomials”, arXiv:1704.04701 (2017).

Solutions 0

No solutions have been posted yet.