Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Sepehr Hajebi · Journal of Graph Theory · 2025
ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer and a graph , every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either or , if (and only if) is a ‐free chordal graph. The “only if” part follows from the properties of the so‐called layered wheels, a construction by Sintiari and Trotignon consisting of (even‐hole, )‐free graphs with arbitrarily large treewidth. Alecu et al. proved recently that the conjecture holds in two special cases: (a) when ; and (b) when for some forest ; that is, is obtained from a forest by adding a universal vertex. Our first result is a common strengthening of (a) and (b): for an integer and graphs and , (even‐hole, )‐free graphs have bounded treewidth if and only if is a forest and is a ‐free chordal graph. Also, for general , we push the current state of the art further than (b) by settling the conjecture for the smallest choices of that are not coned forests. The latter follows from our second result: we prove the conjecture when is a crystal; that is, a graph obtained from arbitrarily many coned double stars by gluing them together along the “middle” edges of the double stars. In the first version of this paper, we suggested the following which is a strengthening of our main conjecture: for every , every graph of sufficiently large treewidth has an induced subgraph of treewidth which is either complete, complete bipartite, or 2‐degenerate. This strengthening has now been refuted by Chudnovsky and Trotignon [On treewidth and maximum cliques, arxiv:2405.07471, 2024].