Faster Combinatorial k-Clique Algorithms

Amir Abboud, Nick Fischer, Yarin Shechter

Detecting if a graph contains a $k$-Clique is one of the most fundamental problems in computer science. The asymptotically fastest algorithm runs in time $O(n^{\omega k/3})$, where $\omega$ i…