Note on the second eigenvalue of regular graphs
Combinatorics
2023-11-22 v2
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.
Cite
@article{arxiv.2311.07629,
title = {Note on the second eigenvalue of regular graphs},
author = {Igor Balla and Eero Räty and Benny Sudakov and István Tomon},
journal= {arXiv preprint arXiv:2311.07629},
year = {2023}
}
Comments
This is a companion note to arXiv:2311.02070, and we do not plan to publish it as a separate paper