Completed
1. A bridge between graph theory and additive combinatorics
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Graph Theory and Additive Combinatorics (Fall 2019)
Automatically move to the next video in the Classroom when playback concludes
- 1 1. A bridge between graph theory and additive combinatorics
- 2 2. Forbidding a subgraph I: Mantel's theorem and Turán's theorem
- 3 3. Forbidding a subgraph II: complete bipartite subgraph
- 4 4. Forbidding a subgraph III: algebraic constructions
- 5 5. Forbidding a subgraph IV: dependent random choice
- 6 6. Szemerédi's graph regularity lemma I: statement and proof
- 7 7. Szemerédi's graph regularity lemma II: triangle removal lemma
- 8 8. Szemerédi's graph regularity lemma III: further applications
- 9 9. Szemerédi's graph regularity lemma IV: induced removal lemma
- 10 10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof
- 11 11. Pseudorandom graphs I: quasirandomness
- 12 12. Pseudorandom graphs II: second eigenvalue
- 13 13. Sparse regularity and the Gree-Tao theorem
- 14 14. Graph limits I: introduction
- 15 15. Graph limits II: regularity and counting
- 16 16. Graph limits III: compactness and applications
- 17 17. Graph limits IV: inequalities between subgraph densities
- 18 18. Roth's theorem I: Fourier analytic proof over finite field
- 19 19. Roth's theorem II: Fourier analytic proof in the integers
- 20 20. Roth's theorem III: polynomial method and arithmetic regularity
- 21 21. Structure of set addition I: introduction to Freiman's theorem
- 22 22. Structure of set addition II: groups of bounded exponent and modeling lemma
- 23 23. Structure of set addition III: Bogolyubov's lemma and the geometry of numbers
- 24 24. Structure of set addition IV: proof of Freiman's theorem
- 25 25. Structure of set addition V: additive energy and Balog-Szemerédi-Gowers theorem
- 26 26. Sum-product problem and incidence geometry
