Sepehr Hajebi, Holes, hubs and bounded treewidth
Zoom ID: 869 4632 6610 (ibsdimag)A hole in a graph $G$ is an induced cycle of length at least four, and for every hole $H$ in $G$, a vertex $h\in G\setminus H$ is called a $t$-hub for $H$ if $h$ has at least $t$ neighbor in $H$. Sintiari and Trotignon were the first to construct graphs with arbitrarily large treewidth …