Treewidth, Hadwiger Number, and Induced Minors

Abstract

Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say that a graph class $\mathcal{G}$ is (tw,had)-bounded if there is a function $f$ (called the (tw,had)-bounding function) such that tw$(G)$ $\leq$ $f$(had$(G)$) for every graph $G \in \mathcal{G}$. We characterise (tw,had)-bounded graph classes as those that exclude some planar graph as an induced minor, and use this characterisation to show that every proper vertex-minor-closed class is (tw,had)-bounded. Furthermore, we demonstrate that any (tw,had)-bounded graph class has a (tw,had)-bounding function in O(had$(G)^9$polylog(had$(G)$)). Our bound comes from the bound for the Grid Minor Theorem given by Chuzhoy and Tan, and any quantitative improvement to their result will lead directly to an improvement to our result. More strongly, we conjecture that every (tw,had)-bounded graph class has a linear (tw,had)-bounding function. In support of this conjecture, we show that it holds for the class of outer-string graphs, and for a natural generalisation of outer-string graphs: intersection graphs of strings rooted at the boundary of a fixed surface. We also verify our conjecture for low-rank perturbations of circle graphs, which is an important step towards verifying it for all proper vertex-minor-closed classes.

Figures (6)

• Figure 1: An outer-string graph (left) with a representation (right).
• Figure 2: Partition into subgraphs $G_{a,b}$.
• Figure 3: Finding an induced $(k\times k)$-grid when there are no jump edges in $H_{a,b}$.
• Figure 4: Finding vertex-disjoint rooted paths $P_{a,b}$ and $Q_{a,b}$.
• Figure 5: $K_{2s}$ minor in $P_{2s} \boxtimes P_{2s}$.

Theorems & Definitions (65)

• Theorem 1
• Theorem 2
• Conjecture 3
• Theorem 4
• Theorem 5
• Theorem 6
• Theorem 7: CT21
• Lemma 8
• proof
• Lemma 9