2025 conjecture on the Lovász number of random circulant graphs
Let tend to infinity through odd integers. Define the random circulant graph on by taking independent random variables and joining distinct vertices whenever , where . The conjecture is that as through odd integers, where denotes the Lovász number of .
References
- Sharp asymptotics for the Lovász number of random circulant graphs — arXiv — Xin Chen, Hongwei Hu, Yanqing Hu, Wei Wang, Luzhen Yang
Source: arXiv
Progress summary
An unrefereed October 2026 preprint claims to prove the conjectured sharp asymptotic, but the claim has not been independently verified.
The conjecture asserts that the expected Lovász number of a dense random circulant graph satisfies .
Known results
The 2025 work of Afonso S. Bandeira, Jarosław Błasiok, Daniil Dmitriev, Ulysse Faure, Anastasia Kireeva, and Dmitriy Kunisky proved , leaving the sharp asymptotic open.
October 2026 claimed resolution
Xin Chen, Hongwei Hu, Yanqing Hu, Wei Wang, and Luzhen Yang claim the conjectured sharp asymptotics, addressing the dependence among edge indicators in the distance-bit model. The retrieved evidence is an unrefereed preprint, so this is a claimed resolution rather than a verified one.
Current status (as of October 2026): An October 2026 preprint claims to establish , but the result remains unverified.
Solutions 0
No solutions have been posted yet.