Seminars and Colloquiums

Let $\mathcal{F}$ be a fixed, finite family of graphs. In the $\mathcal{F}$-Deletion problem, the input is a graph G and a positive integer k, and the goal is …