ConceptTheory & Algos
Ramanujan graphs
Explicit d-regular expander graphs whose nontrivial eigenvalues satisfy the optimal bound given by Friedman's theorem without the asymptotic error term.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.