A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Given a graph G=(V,E), a set ℱ of forbidden subgraphs, we study ℱ-Free Edge Deletion, where the goal is to remove minimum number of edges such that the resulting graph does not contain any F∈ℱ as a subgraph. For the parameter treewidth, the question of whether the problem is FPT has remained open. Here we give a negative answer by showing that the problem is W-hard when parameterized by the treewidth, which rules out FPT algorithms under common assumption. Thus we give a solution to thearXiv:2102.06068v1 fatcat:eflv7gnsinagvkf3wmfrnqiu7i