Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique

Yijia Chen, Yi Feng, Bundit Laekhanukit +1

In the parameterized $k$-clique problem, or $k$-Clique for short, we are given a graph $G$ and a parameter $k\ge 1$. The goal is to decide whether there exist $k$ vertices in $G$ t…