Szemerédi's regularity lemma revisited

Details Szemerédi's regularity lemma revisited Szemerédi's regularity lemma revisited

2005-04-22

arxiv.org/abs/math/0504472v2

Mathematics

Combinatorics

21 pages, to appear, Contributions to Discrete Mathematics. This is the final version, incorporating the referee's suggestions

Scientific paper

Szemer\'edi's regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemer\'edi's theorem on arithmetic progressions . In this note we revisit this lemma from the perspective of probability theory and information theory instead of graph theory, and observe a variant of this lemma which introduces a new parameter $F$. This stronger version of the regularity lemma was iterated in a recent paper of the author to reprove the analogous regularity lemma for hypergraphs.

Affiliated with

Also associated with

No associations

Rating

Szemerédi's regularity lemma revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Szemerédi's regularity lemma revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Szemerédi's regularity lemma revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-612097