Expander mixing lemma
The expander mixing lemma states that, for any two subsets of a d-regular expander graph with vertices, the number of edges between and is approximately what you would expect in a random d-regular graph, i.e. .
Wikipage redirect
primaryTopic
Expander mixing lemma
The expander mixing lemma states that, for any two subsets of a d-regular expander graph with vertices, the number of edges between and is approximately what you would expect in a random d-regular graph, i.e. .
has abstract
The expander mixing lemma stat ...... random d-regular graph, i.e. .
@en
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
741,358,643
comment
The expander mixing lemma stat ...... random d-regular graph, i.e. .
@en
label
Expander mixing lemma
@en