Szemerédi’s Regularity Lemma

Abstract

Szemerédi’s Regularity Lemma is an important result in extremal graph theory. Roughly speaking, the lemma states that every graph can be approximated by random graphs; that is, the vertex set of every graph can be split into equal size subsets such that the distribution of the edges between almost any two of these subsets is pseudorandom. The Regularity… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics