Every graph of large rank-depth contains a pivot-minor isomorphic to a long path or to two cliques joined by a half-graph, resolving a 2021 conjecture.
Farley, and Andrzej Proskurowski, Obstructions for linear rank-width at most 1, Discrete Appl
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Unavoidable pivot-minors in graphs of large rank-depth
Every graph of large rank-depth contains a pivot-minor isomorphic to a long path or to two cliques joined by a half-graph, resolving a 2021 conjecture.