On Szemeredi’s Regularity Lemma

Authors

Josh Hanes, University of Mississippi

Document Type

Lecture

Publication Date

10-2-2003

Abstract

Szemer´ edi’s Regularity Lemma states that for every > 0 and every integer m 1there exist an integer M such that every graph of order at least m admits an-regular partition V0 V1 Vk with m k M. Wewill give an account of the theory behind Szemer´ edi’s Regularity Lemma and provide a partial proof of the result. Then we will conclude with several applications of this major result.

Relational Format

presentation

Recommended Citation

Hanes, Josh, "On Szemeredi’s Regularity Lemma" (2003). Combinatorics Seminar. 108.
https://egrove.olemiss.edu/math_combinatorics/108