On Lower Bounds of Approximating Parameterized $k$-Clique

Bingkai Lin, Xuandi Ren, Yican Sun +1

Given a simple graph $G$ and an integer $k$, the goal of $k$-Clique problem is to decide if $G$ contains a complete subgraph of size $k$. We say an algorithm approximates $k$-Cliqu…