Kanté and Kwon's linear rank-width conjecture for vertex-minor-closed classes
Statement
Let a graph class be vertex-minor-closed if every vertex-minor of every graph in the class also belongs to the class. A graph class has bounded linear rank-width if there is a constant bounding the linear rank-width of all its graphs.
Kanté and Kwon's conjecture. A vertex-minor-closed class of graphs has bounded linear rank-width if and only if it does not contain some tree.
This conjecture is part of the structural theory of vertex-minors, paralleling the characterization of bounded rank-width by excluding a circle graph. Its resolution is not specified in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.