Treewidth versus clique number. V. Further connections with tree-independence number
Authors:
Preprint
Abstract
We continue the study of $(tw,ω)$-bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree-independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel in 2024. Dallard et al. showed that bounded tree-independence number is sufficient for $(tw,ω)$-boundedness, and conjectured that the converse holds. While this conjecture has been recently disproved, it is still interesting to determine classes where the conjecture holds; for example, the conjecture is still open for graph classes excluding an induced star, as well as for finitely many forbidden induced subgraphs. In this paper, we identify further families of graph classes where $(tw,ω)$-boundedness is equivalent to bounded tree-independence number. We settle a number of cases of finitely many forbidden induced subgraphs, obtain several equivalent characterizations of $(tw, ω)$-boundedness in subclasses of the class of complements of line graphs, and give a short proof of a recent result of Ahn, Gollin, Huynh, and Kwon [SODA 2025] establishing bounded tree-independence number for graphs excluding a fixed induced star and a fixed number of independent cycles.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Detecting $K_{2,3}$ as an Induced Minor2024
- Tree independence number I. (Even hole, diamond, pyramid)‐free graphsJournal of Graph Theory, 2024
- Grid induced minor theorem for graphs of small degreeJournal of Combinatorial Theory, Series B, 2023
- Tree-width dichotomyEuropean Journal of Combinatorics, 2022
- On H-Topological Intersection GraphsAlgorithmica, 2021
- On the chromatic number of -free graphsDiscrete Applied Mathematics, 2019
- Tree-chromatic numberJournal of Combinatorial Theory, Series B, 2016
- Extending the Gyárfás–Sumner conjectureJournal of Combinatorial Theory, Series B, 2014
- Paw-free graphsInformation Processing Letters, 1988
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986