Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes
FOCS, pp. 1358-1377, 2015.
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three ingredients: (1) a formula for the expected characteristic polynomial of the sum of a regular graph with a rand...More
Full Text (Upload PDF)
PPT (Upload PPT)