A strengthening and a multipartite generalization of the Alon-Boppana-Serre Theorem
Bojan Mohar

TL;DR
This paper extends the Alon-Boppana-Serre theorem to multipartite and non-regular graphs, providing elementary proofs and new bounds on eigenvalues related to graph structure and girth.
Contribution
It introduces a multipartite generalization of the Alon-Boppana-Serre theorem, applicable to non-regular graphs, and establishes bounds involving graph girth and eigenvalues.
Findings
Extends Alon-Boppana-Serre to non-regular graphs with minimum degree d
Shows a positive proportion of eigenvalues exceed a specific bound in multipartite graphs
Provides bounds on negative eigenvalues based on odd girth
Abstract
The Alon-Boppana theorem confirms that for every and every integer , there are only finitely many -regular graphs whose second largest eigenvalue is at most . Serre gave a strengthening showing that a positive proportion of eigenvalues of any -regular graph must be bigger than . We provide a multipartite version of this result. Our proofs are elementary and work also in the case when graphs are not regular. In the simplest, monopartite case, our result extends the Alon-Boppana-Serre result to non-regular graphs of minimum degree and bounded maximum degree. The two-partite result shows that for every and any positive integers , every -vertex graph of maximum degree at most , whose vertex set is the union of (not necessarily disjoint) subsets , such that every vertex in …
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.
