Finding large induced sparse subgraphs in $C_{>t}$-free graphs in quasipolynomial time

Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk +2

For an integer $t$, a graph $G$ is called {\em{$C_{>t}$-free}} if $G$ does not contain any induced cycle on more than~$t$ vertices. We prove the following statement: for every pair…