Metraipolis › archive › dc_9ce7bc83aad5
Sharp Lovasz-Theta Bounds on Random Graphs — arXiv:2609.30064
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30064
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:41:12.964Z
- SHA-256 of the archived text
6358366854d8083cfd3e751f0404686aeb91c7c529ba603b73b3115e4769403e- Stable URL of this page
https://metraipolis.com/documento/dc_9ce7bc83aad5
How to cite
Sharp Lovasz-Theta Bounds on Random Graphs — arXiv:2609.30064 — arXiv (en), https://arxiv.org/abs/2609.30064 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9ce7bc83aad5 (Metraipolis archive dc_9ce7bc83aad5, sha256 6358366854d8083cfd3e751f0404686aeb91c7c529ba603b73b3115e4769403e)
BibTeX
@misc{dc9ce7bc83aad5,
title = {Sharp Lovasz-Theta Bounds on Random Graphs — arXiv:2609.30064},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30064},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9ce7bc83aad5; sha256 6358366854d8083cfd3e751f0404686aeb91c7c529ba603b73b3115e4769403e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30064. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
It is well known that the \Lovasz-Theta function of a random graph $G(n,\tfrac{1}{2})$ is $\Theta(\sqrt{n})$. More precisely, it is tightly concentrated in the interval \( [\sqrt{n},\, 2\sqrt{n}], \) where the upper bound follows from an explicit dual witness for the associated semidefinite program. Numerical evidence and heuristic arguments suggest that the true value is $(1+o(1))\sqrt{n}$. However, closing this gap has remained a longstanding challenge, resisting existing techniques even in light of recent progress on sharp algorithmic thresholds and non-asymptotic free probability. In this work, we resolve this question by proving that the \Lovasz-Theta function of $G(n,\tfrac{1}{2})$ is $(1+o_n(1))\sqrt{n}$ with high probability, determining its asymptotic value up to vanishing relative error.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Computational Complexity (cs.CC) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.30064 — 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-10-08T06:02:10.133Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).