Igor Balla, Eero Räty, Benny Sudakov, István Tomon·2023-11-13·via math.CO updates on arXiv.org
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.