For every apex-forest H, every graph with tree-width at least |V(H)|−1 contains H as a minor, and wheels satisfy a new near-linear bound.
Seymour, and Robin Thomas
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
-
Tree-width of a graph excluding an apex-forest or a wheel as a minor
For every apex-forest H, every graph with tree-width at least |V(H)|−1 contains H as a minor, and wheels satisfy a new near-linear bound.