Induced subgraphs of bounded treewidth and the container method

Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk +2

A hole in a graph is an induced cycle of length at least 4. A hole is long if its length is at least 5. By $P_t$ we denote a path on $t$ vertices. In this paper we give polynomial-…