Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies

We consider the Π-FREE DELETION problem parameterized by the size of a vertex cover, for a range of graph properties Π. Given an input graph G, this problem asks whether there is a subset of at most k vertices whose removal ensures the resulting graph does not contain a graph from Π as an induced subgraph. We introduce the concept of characterizing a graph property Π by low-rank adjacencies, and use it as the cornerstone of a general kernelization theorem for Π-FREE DELETION parameterized by the size of a vertex cover. The resulting framework captures problems such as AT-FREE DELETION, WHEEL-FREE DELETION, and INTERVAL DELETION. Moreover, our new framework shows that the vertex-deletion problem to perfect graphs has a polynomial kernel when parameterized by vertex cover, thereby resolving an open question by Fomin et al. (2014) [18].