Subquadratic Kernels for Implicit 3-H itting S et and 3-S et P acking Problems

Abstract

We consider four well-studied NP-complete packing/covering problems on graphs: F eedback V ertex S et in T ournaments (FVST), C luster V ertex D eletion (CVD), T riangle P acking in T ournaments (TPT) and I nduced P 3 -P acking . For these four problems, kernels with O ( k 2 ) vertices have been known for a long time. In fact, such kernels can be obtained by interpreting these problems as finding either a packing of k pairwise disjoint sets of size 3 (3-S et P acking ) or a hitting set of size at most k for a family of sets of size at most 3 (3-H itting S et ). In this article, we give the first kernels for FVST, CVD, TPT, and I nduced P 3 -P acking with a subquadratic number of vertices. Specifically, we obtain the following results. • FVST admits a kernel with O ( k 3/2 ) vertices. • CVD admits a kernel with O ( k 5/3 ) vertices. • TPT admits a kernel with O ( k 3/2 ) vertices. • I nduced P 3 -P acking admits a kernel with O ( k 5/3 ) vertices. Our results resolve an open problem from WorKer 2010 on the existence of kernels with O( k 2−ϵ ) vertices for FVST and CVD. All of our results are based on novel uses of old and new “expansion lemmas” and a weak form of crown decomposition where (i) almost all of the head is used by the solution (as opposed to all ), (ii) almost none of the crown is used by the solution (as opposed to none ), and (iii) if H is removed from G , then there is almost no interaction between the head and the rest (as opposed to no interaction at all).