Treewidth versus clique number. I. Graph classes with a forbidden structure

Clément Dallard, Martin Milanič, Kenny Štorgel

Treewidth is an important graph invariant, relevant for both structural and algorithmic reasons. A necessary condition for a graph class to have bounded treewidth is the absence of…