Hardness of approximation for H-free edge modification problems

Ivan Bliznets, Marek Cygan, Pawel Komosa +1

The $H$-Free Edge Deletion problem asks, for a given graph $G$ and an integer $k$, whether it is possible to delete at most $k$ edges from $G$ to make it $H$-free, that is, not con…