Lubotzky, Phillips, and Sarnak (1988), Margulis (1988), and Morgenstern (1994) show how Ramanujan graphs can be constructed explicitly.
Graph of a function | graph | Bipartite graph | planar graph | graph theory | directed graph | Under Graph | random graph | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | Volume expander | visibility graph | Unit distance graph | rook's graph | Rado graph | minor (graph theory) | Lattice graph | interval graph | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph | Factor graph | Exponential random graph models | Directed graph | Directed acyclic graph |