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 in 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.

中文翻译：

---

无K _t边删除的内核

在里面 ${ķ}_{Ť}$无边删除问题输入的是图G和一个整数k，目标是确定是否存在G的最多k个边的集合，这些边的去除导致图的大小不为t。在本文中，我们给出了解决该问题的内核$Ø（{ķ}^{Ť-\mathrm{1个}}）$ 顶点和边缘。