On the smallest eigenvalues of $3$-colorable graphs
Combinatorics
2025-09-30 v2 Metric Geometry
Abstract
We prove that the set of the smallest eigenvalues attained by -colorable graphs is dense in , where and is the positive real root of . 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.
Cite
@article{arxiv.2505.03014,
title = {On the smallest eigenvalues of $3$-colorable graphs},
author = {Zilin Jiang and Zhiyu Wang},
journal= {arXiv preprint arXiv:2505.03014},
year = {2025}
}
Comments
13 pages, 3 figures; full proofs of Lemmas 11 and 12 added in Appendix A