Szemerédi regularity lemma

Actually a theorem in graph theory.

Szemerédi’s regularity lemma states that a graph can be partitioned into a bounded number of parts so that the edges between parts are regular.