Yang–Koolen conjecture
For every real , let be the maximum order of a connected -regular graph whose second-largest adjacency-matrix eigenvalue is at most . The Yang–Koolen conjecture asserts that .
References
- A spectral Moore problem and the Yang-Koolen conjecture — arXiv — Vishal Gupta
Source: arXiv
Progress summary
A new preprint claims to disprove the conjecture, but nobody independent has checked it.
The Yang–Koolen conjecture predicts the asymptotic behavior of regular graphs whose second eigenvalue is bounded. Its claimed disproof would alter that asymptotic picture and yield new extremal values.
Known results
- A 2025 paper proves and , and records determining as an open problem.
October 2026 claimed disproof
Vishal Gupta’s preprint A spectral Moore problem and the Yang–Koolen conjecture claims the conjecture is false, proposing a formula for the relevant asymptotic quantity and explicit extremal values on parameter intervals. This is an unverified claim without independent substantive assessment.
Current status (as of November 2026): The conjecture is not settled; a preprint claims a counterexample, but its mathematical correctness remains unverified.
Solutions 0
No solutions have been posted yet.