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

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 of integers $d$ and $t$ and a CMSO$2$ statement~$\phi$, there exists an algorithm that, given an $n$-vertex $C{>t}$-free graph $G$ with weights on vertices, finds in time $n^{O(\log4 n)}$ a maximum-weight vertex subset $S$ such that $G[S]$ has degeneracy at most $d$ and satisfies $\phi$. The running time can be improved to $n^{O(\log2 n)}$ assuming $G$ is $Pt$-free, that is, $G$ does not contain an induced path on $t$ vertices. This expands the recent results of the authors [to appear at FOCS 2020 and SOSA 2021] on the {\sc{Maximum Weight Independent Set}} problem on $Pt$-free graphs in two directions: by encompassing the more general setting of $C{>t}$-free graphs, and by being applicable to a much wider variety of problems, such as {\sc{Maximum Weight Induced Forest}} or {\sc{Maximum Weight Induced Planar Graph}}.