# Foreshadowing the Grid Theorem for Induced Subgraphs

Loading...

## Date

2024-08-07

## Authors

## Journal Title

## Journal ISSN

## Volume Title

## Publisher

University of Waterloo

## Abstract

We prove several dichotomy theorems toward a complete description of the unavoidable induced subgraphs of graphs with large treewidth. This is motivated by the Grid Theorem of Robertson and Seymour (1986) which achieves the same goal for minors (and subgraphs).
Given a graph class C, we say that C is clean if the only induced subgraph obstructions to bounded treewidth in C are the basic ones: complete graphs, complete bipartite graphs, subdivided walls and the line graphs of the subdivided walls. The analog of the Grid Theorem for induced subgraphs (still out of reach) is then observed to be equivalent to a characterization of all hereditary classes that are clean.
We characterize all clean classes that are defined by finitely many excluded induced subgraphs. Specifically, we identify a family of “non-basic” obstructions which, in this scenario, litmus-test the clean classes against the non-clean ones.
The analogous characterization remains elusive in the case of infinitely many forbidden
induced subgraphs. Among the infinite sets of graphs whose exclusion is known to result in
a non-clean class, the following four appear to expose a distinctive gap in our understanding
of cleanness:
(1) Graphs which are the union of three cycles, all sharing a vertex and otherwise pairwise
vertex-disjoint.
(2) Graphs which are the union of two vertex-disjoint cycles.
(3) Graphs consisting of two non-adjacent vertices with three pairwise internally disjoint
paths between them, known as thetas.
(4) Cycles with an even number of vertices (at least four), known as even holes.
For i = 1, 2, 3, 4, let Ci be the class obtained by excluding the ith set above. We prove a full “grid-type theorem” for each of C1 and C2. Both results extend to an arbitrary number of excluded cycles (instead of “three” and “two”) of lower bounded lengths.
In C3 and C4, we characterize the “local” structure of graphs with large treewidth. Explicitly, given a graph H, we prove the following:
(a) Every (theta, K3)-free graph of large enough treewidth has an induced subgraph isomorphic to H, if and only if H is a K3-free chordal graph (that is, a forest).
(b) Every (even hole K4)-free graph of large enough treewidth has an induced subgraph isomorphic to H, if and only if H is a K4-free chordal graph.
We generalize both (a) and (b) to the “right” class of Kt-free graphs for all t. We also derive, from a very special case of (b), one of the two conjectures of Sintiari and Trotignon on even-hole-free graphs of large treewidth.

## Description

## Keywords

Graph Theory, Graph Minors, Induced Subgraphs, Treewidth, Grid Theorem