This is a 26-lecture course, with each lecture being about 60-90 minutes, given at MIT in person by Yufei Zhao. It is a graduate lecture course in graphs and additive combinatorics.
This course examines classical and modern developments in graph theory and additive combinatorics, with a focus on topics and themes that connect the two subjects. The course also introduces students to current research topics and open problems.
- A bridge between graph theory and additive combinatorics
- Forbidding a subgraph I: Mantel’s theorem and Turán’s theorem
- Forbidding a subgraph II: Complete bipartite subgraph
- Forbidding a subgraph III: Algebraic constructions
- Forbidding a subgraph IV: Dependent random choice
- Szemerédi’s graph regularity lemma I: Statement and proof
- Szemerédi’s graph regularity lemma II: Triangle removal lemma
- Szemerédi’s graph regularity lemma III: Further applications
- Szemerédi’s graph regularity lemma IV: Induced removal lemma
- Szemerédi’s graph regularity lemma V: Hypergraph removal and spectral proof
- Pseudorandom graphs I: Quasirandomness
- Pseudorandom graphs II: Second eigenvalue
- Sparse regularity and the Green-Tao theorem
- Graph limits I: Introduction
- Graph limits II: Regularity and counting
- Graph limits III: Compactness and applications
- Graph limits IV: Inequalities between subgraph densities
- Roth’s theorem I: Fourier analytic proof over finite field
- Roth’s theorem II: Fourier analytic proof in the integers
- Roth’s theorem III: Polynomial method and arithmetic regularity
- Structure of set addition I: Introduction to Freiman’s theorem
- Structure of set addition II: Groups of bounded exponent and modelling lemma
- Structure of set addition III: Bogolyubov’s lemma and the geometry of numbers
- Structure of set addition IV: Proof of Freiman’s theorem
- Structure of set addition V: Additive energy and Balog-Szemerédi-Gowers theorem
- Sum-product problem and incidence geometry
These videos are of a lecture course by Yufei Zhao at the Massachusetts Institute of Technology in 2019, and made available as part of its OpenCourseWare initiative. The website for the course may be found here.

