For disjoint nonempty vertex sets , write
The pair is a regular pair of vertex sets with parameter if
whenever , , , and .
The Szemerédi regularity lemma says that for every and there are such that every graph on at least vertices has a partition
where , , the classes have equal size, and all but at most pairs are -uniform.

Articles by others on the same topic (0)

There are currently no matching articles.