e/Expander mixing lemma

Information
has gloss	eng: The expander mixing lemma states that, for any two subsets S, T of a regular expander graph G, the number of edges between S and T is approximately what you would expect in a random d-regular graph, i.e. d \|S\| \cdot \|T\| / n.
lexicalization	eng: Expander Mixing Lemma
instance of	c/Lemmas