For disjoint nonempty vertex sets , write
The pair is -uniform if
whenever , , , and .
The Szemerédi regularity lemma states that for every and integer there are such that every graph on vertices has a partition
with , , equal sizes , and at most pairs that are not -uniform.

Articles by others on the same topic (0)

There are currently no matching articles.