Metraipolis › archive › dc_d50c02b71dbe
The k-Clique hypothesis is dead, for good — arXiv:2611.09764
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09764
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:47:16.467Z
- SHA-256 of the archived text
37299f93e31aa6c7d8a2779fe1bed128388ddd37bfa5d6a685abefaaa5ca368f- Stable URL of this page
https://metraipolis.com/documento/dc_d50c02b71dbe
How to cite
The k-Clique hypothesis is dead, for good — arXiv:2611.09764 — arXiv (en), https://arxiv.org/abs/2611.09764 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d50c02b71dbe (Metraipolis archive dc_d50c02b71dbe, sha256 37299f93e31aa6c7d8a2779fe1bed128388ddd37bfa5d6a685abefaaa5ca368f)
BibTeX
@misc{dcd50c02b71dbe,
title = {The k-Clique hypothesis is dead, for good — arXiv:2611.09764},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09764},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d50c02b71dbe; sha256 37299f93e31aa6c7d8a2779fe1bed128388ddd37bfa5d6a685abefaaa5ca368f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09764. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present an algorithm that solves the $k$-Clique problem for any large enough $k$ and any $n$-vertex graph in $n^{\left(\frac{\omega}{3}-c\right)k}$ time, where $\omega\geq 2$ is the matrix multiplication exponent and $c>0$ is a positive constant independent of both $\omega$ and $k$. This refutes the long-standing $k$-Clique conjecture, regardless of the value of the matrix multiplication constant, even if $\omega=2$. In fact, our algorithm solves the more general problem of counting weighted $k$-Cliques.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2611.09764 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:40:29.883Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).