EXTREMAL GRAPH THEORY

The Erdös-Stone theorem. Stability. Supersaturation. Szemerédi’s regularity lemma. Hypergraphs. The size of a hereditary property. Containers. The local lemma. Tail estimation. Martingales inequalities. The chromatic number of a random graph. The semi-random method.

Extremal Graph Theory, written by D. Chua, based on lectures by A. G. Thomason, 2017, University of Cambridge.

  • With Solutions
  • Without Solutions