Kanté–Kwon conjecture on vertex-minors of forests in graphs of large linear rank-width

Let TT be a fixed forest, and let f(T)f(T) denote an integer depending on TT. A graph has linear rank-width at least f(T)f(T) when its linear rank-width is at least that integer.

Kanté–Kwon conjecture. For every fixed forest TT, there is an integer f(T)f(T) such that every graph of linear rank-width at least f(T)f(T) contains a vertex-minor isomorphic to TT.

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

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.