Expander graph

Layer 0 — Mathematicsin the graph-theory subtree

Sparse highly-connected graph: h(G) ≥ c. Explicit: Lubotzky-Phillips-Sarnak Ramanujan graphs. Derandomization, extractors, error-correcting codes.