Bipartite Ramanujan Graphs

The Ramanujan graphs are the “best possible” expanders in the sense that the largest nontrivial eigenvalues of their adjacency matrices are at most 2 √ d− 1, which matches the theoretical lower bound of Alon and Boppana (see [12]).