Szemerédi regularity lemma

From Wikipedia, the free encyclopedia

You have new messages (last change).

In mathematics, Szemerédi's regularity lemma states that for every ε > 0 and every positive integer t there is an integer

T = T(ε,t)

such that every graph with n > T vertices has an ε-regular partition into k + 1 classes, t\leq k\leq T


This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../s/z/e/Szemer%C3%A9di_regularity_lemma.html"