Tightness conjecture for the rooted minor bound
The preceding theorem gives a bound on rooted 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.
References
Primary source
Benjamin Moore, “Rooted Graph Minors and Reducibility of Graph Polynomials”, arXiv:1704.04701 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.