Let H be a fixed graph. The H-Transversal problem, given graph G, asks to remove the smallest number of vertices from G so that does not contain as subgraph. While simple |V(H)|-approximation algorithm exists and is believed tight for every 2-vertex-connected H, strongest known hardness approximation any tree was Ω(log⁡|V(H)|)-inapproximability when star. In this paper, we identify natural para...