Combinatorics Trees, paths, cycles, connectivity Concept
Expander graph
Summary
An expander graph is a sparse graph in which every set of at most half of the vertices has many edges leaving it. One usually means a family of regular graphs of fixed degree whose Cheeger constant stays above a fixed positive bound. Expanders combine few edges with strong connectivity, and they are used in network design, error-correcting codes, derandomization and group theory.
Further reading
About this page
| Tag | DXJXVFV79H |
|---|---|
| URI | m2://DXJXVFV79H |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C48, 05C50 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.