Kernel for Kt-free edge deletion

08/09/2019

∙

by   Dekel Tsur, et al.

∙

0

∙

share

In the K_t-free edge deletion problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges of G whose removal results a graph with no clique of size t. In this paper we give a kernel to this problem with O(k^t-1) vertices and edges.