A positive instance of Scott's Conjecture on induced subdivisions

Kathie Cameron, Ni Luh Dewi Sintiari, Sophie Spirkl

For a graph $G$, $\chi (G)$ denotes the chromatic number of $G$ and $\omega (G)$ denotes the size of the largest clique in $G$. A hereditary class of graphs is called $\chi$-bounded if there is…