Kanté–Kwon conjecture on vertex-minors of forests in graphs of large linear rank-width
Kanté–Kwon conjecture on vertex-minors of forests in graphs of large linear rank-width
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.
Sources & referencesView supporting material
Primary source
O-joung Kwon and Sang-il Oum, “Scattered classes of graphs”, arXiv:1801.06004 (2020).
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.