← All problems

Lv–Koolen problem on the smallest eigenvalue of distance-regular graphs

Let Γ\Gamma be a distance-regular graph with valency kk, diameter D≥3D\ge 3, and eigenvalues k=θ0>θ1>⋯>θDk=\theta_0>\theta_1>\cdots>\theta_D. Define b≔b1/(θ1+1)b\coloneqq b_1/(\theta_1+1). Is −θD-\theta_D bounded above by a quantity depending only on DD and bb; equivalently, for each fixed DD and bb, is the set of possible values of −θD-\theta_D over such graphs finite and bounded?

References

Progress summary

Refreshed
Open · solution reported

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.