Lv–Koolen problem on the smallest eigenvalue of distance-regular graphs
Let be a distance-regular graph with valency , diameter , and eigenvalues . Define . Is bounded above by a quantity depending only on and ; equivalently, for each fixed and , is the set of possible values of over such graphs finite and bounded?
References
- Resolving a Problem of Lv and Koolen on the Smallest Eigenvalue of Distance-Regular Graphs — arXiv — Zhen-Mu Hong, Fu-Tao Hu, Chenhui Lv
Source: arXiv
Progress summary
An October 2026 preprint claims to settle the problem, but the claim has not been independently confirmed.
The Lv–Koolen problem asks for sharp bounds on the smallest eigenvalue of distance-regular graphs. The newly reported work claims to resolve this bounding question and determine sharpness for each fixed diameter.
Recent claimed solution (October 2026)
Hong, Hu, and Lv's preprint Resolving a Problem of Lv and Koolen on the Smallest Eigenvalue of Distance-Regular Graphs claims a product bound, characterizes equality, and gives an explicit asymptotically sharp bound for sufficiently large valency. It is an unrefereed preprint, so the claimed resolution remains unverified.
Current status (as of October 2026): The problem has a claimed solution giving bounds, equality cases, and sharpness information, but no independently verified resolution is recorded.
Sources
Solutions 0
No solutions have been posted yet.