2000 character limit reached
Kernel for Kt-free edge deletion (1908.03600v1)
Published 9 Aug 2019 in cs.DS
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.