ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.