Extremal results in sparse pseudorandom graphs

  title={Extremal results in sparse pseudorandom graphs},
  author={David Conlon and Jacob Fox and Yufei Zhao},
Szemerédi’s regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi’s regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi’s regularity lemma use an associated counting lemma. In order to prove extensions of these results which also apply to… CONTINUE READING


Publications referenced by this paper.

Similar Papers

Loading similar papers…