%0 Journal Article
%T From Ramanujan graphs to Ramanujan complexes
%A Alexander Lubotzky
%A Ori Parzanchevski
%J -
%D 2020
%R 10.1098/rsta.2018.0445
%X Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high-dimensional theory has e..
%U https://royalsocietypublishing.org/doi/10.1098/rsta.2018.0445