Ramanujan graphs (Q1112836): Difference between revisions

A \(k\)-regular graph on \(n\) vertices is called Ramanujan graph if \(|\lambda|\leq 2\cdot\sqrt{k-1}\), where \(\lambda\) is the largest eigenvalue of its adjacency matrix. These graphs yield best known explicit expanders. The paper contains a large variety of results concerning nontrivial extremal combinatorial properties of Ramanujan and related graphs.