On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

For a set of graphs $\mathcal{H}$, the \textsc{$\mathcal{H}$-free Edge Deletion} problem asks to find whether there exist at most $k$ edges in the input graph whose deletion result…