arXiv · 2505.03014
On the smallest eigenvalues of $3$-colorable graphs
Abstract
We prove that the set of the smallest eigenvalues attained by $3$-colorable graphs is dense in $(-\infty, -λ^*)$, where $λ^* = ρ^{1/2} + ρ^{-1/2} \approx 2.01980$ and $ρ$ is the positive real root of $x^3 = x + 1$. As a consequence, in the context of spherical two-distance sets, our result precludes any further refinement of the forbidden-subgraph method through the chromatic number of signed graphs.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zilin Jiang, Zhiyu Wang. 2025-09-28. On the smallest eigenvalues of $3$-colorable graphs. https://arxiv.org/abs/2505.03014
Cite the original work for its findings. Save a collection to share your selection of sources.