Note on the second eigenvalue of regular graphs
arXiv:2311.07629
Abstract
The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs.
arXiv commentThis is a companion note to arXiv:2311.02070, and we do not plan to publish it as a separate paper