Kanté–Kwon conjecture on vertex-minors of forests in graphs of large linear rank-width
Statement
Let be a fixed forest, and let denote an integer depending on . A graph has linear rank-width at least when its linear rank-width is at least that integer.
Kanté–Kwon conjecture. For every fixed forest , there is an integer such that every graph of linear rank-width at least contains a vertex-minor isomorphic to .
This conjecture is an analogue for linear rank-width of Oum's conjecture for rank-width. The source presents it as an open problem, and no resolution is given here.
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.