On the integrability of strongly regular graphs
Jack H. Koolen, Masood Ur Rehman, Qianqian Yang

TL;DR
This paper investigates the conditions under which strongly regular graphs with certain spectral properties are 2-integrable, establishing a new lower bound for their minimal valency.
Contribution
It proves that the minimal valency for such graphs must be at least 166, refining previous bounds and advancing understanding of their integrability.
Findings
Lower bound for minimal valency is 166.
Connected graphs with eigenvalue ≥ -3 and high valency are 2-integrable.
Provides new insights into the spectral properties of strongly regular graphs.
Abstract
Koolen et al. showed that if a connected graph with smallest eigenvalue at least has large minimal valency, then it is -integrable. In this paper, we will prove that a lower bound for the minimal valency is 166.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Advanced Graph Theory Research
