The Algebraic Combinatorics Seminar
Weber 117Expander graphs arising from finite groups Martin Kassabov Cornell University Informally, expander graphs are graphs which can not be easily disconnected. In the case of bounded degree, this property is equivalent to a spectral gap in the Laplacian matrix of the graph. Margulis was the first to find an explicit construction of expander graphs, relating […]