Pivot-minor chi-boundedness conjecture
Pivot-minor chi-boundedness conjecture
For a graph , a graph class has no pivot-minor isomorphic to if none of its members has such a pivot-minor. Pivot-minor conjecture. For every graph , the class of graphs having no pivot-minor isomorphic to is -bounded. This would imply Geelen's vertex-minor conjecture because every pivot-minor is a vertex-minor; it is proved for several families, including pivot-minors of cycles and suitable trees, but remains open in general.
Sources & referencesView supporting material
Primary source
Ilkyoo Choi, O-joung Kwon and Sang-il Oum, “Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors”, arXiv:1512.03481 (2015).
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.