Subexponential-time algorithms for finding large induced sparse subgraphs

Jana Novotná, Karolina Okrasa, Michał Pilipczuk +3

Let $\mathcal{C}$ and $\mathcal{D}$ be hereditary graph classes. Consider the following problem: given a graph $G\in \mathcal{D}$, find a largest, in terms of the number of vertices…