Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes

FOCS, pp. 1358-1377, 2015.

Cited by: 61|Bibtex|Views66|DOI:https://doi.org/10.1109/FOCS.2015.87
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments