Note on the second eigenvalue of regular graphs

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.