arXiv · 2611.09764
The k-Clique hypothesis is dead, for good
Abstract
We present an algorithm that solves the $k$-Clique problem for any large enough $k$ and any $n$-vertex graph in $n^{\left(\fracω{3}-c\right)k}$ time, where $ω\geq 2$ is the matrix multiplication exponent and $c>0$ is a positive constant independent of both $ω$ and $k$. This refutes the long-standing $k$-Clique conjecture, regardless of the value of the matrix multiplication constant, even if $ω=2$. In fact, our algorithm solves the more general problem of counting weighted $k$-Cliques.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Virginia Vassilevska Williams, Or Zamir. 2026-11-06. The k-Clique hypothesis is dead, for good. https://arxiv.org/abs/2611.09764
Cite the original work for its findings. Save a collection to share your selection of sources.