A new parameter family, k-treedepth, is characterized by excluded minors T□P_l for all k-vertex trees T, unifying treedepth, the ladder theorem, and the Grid-Minor Theorem.
A unified treatment of linked and lean tree-decompositions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$ the existence of a linked tree-decompositon of width tw$(G)$. We prove a general theorem on the existence of linked and lean tree-decompositions, providing a unifying proof of many known results in the field, as well as implying some new results. In particular we prove that every matroid $M$ admits a lean tree-decomposition of width tw$(M)$, generalizing the result of Thomas.
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Excluding a rectangular grid
A new parameter family, k-treedepth, is characterized by excluded minors T□P_l for all k-vertex trees T, unifying treedepth, the ladder theorem, and the Grid-Minor Theorem.