Author thumbnail

MIT OpenCourseWare

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019

112,267 views
26 items
Last updated on May 12, 2020
public playlist
1. A bridge between graph theory and additive combinatorics
1:16:21
2. Forbidding a subgraph I: Mantel's theorem and Turán's theorem
1:12:41
3. Forbidding a subgraph II: complete bipartite subgraph
1:16:37
4. Forbidding a subgraph III: algebraic constructions
1:19:45
5. Forbidding a subgraph IV: dependent random choice
1:20:00
6. Szemerédi's graph regularity lemma I: statement and proof
1:19:08
7. Szemerédi's graph regularity lemma II: triangle removal lemma
1:14:51
8. Szemerédi's graph regularity lemma III: further applications
1:21:21
9. Szemerédi's graph regularity lemma IV: induced removal lemma
1:23:16
10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof
1:19:14
11. Pseudorandom graphs I: quasirandomness
1:18:20
12. Pseudorandom graphs II: second eigenvalue
1:19:48
13. Sparse regularity and the Green-Tao theorem
1:19:06
14. Graph limits I: introduction
1:17:09
15. Graph limits II: regularity and counting
1:21:09
16. Graph limits III: compactness and applications
1:19:52
17. Graph limits IV: inequalities between subgraph densities
1:19:41
18. Roth's theorem I: Fourier analytic proof over finite field
1:14:17
19. Roth's theorem II: Fourier analytic proof in the integers
1:20:09
20. Roth's theorem III: polynomial method and arithmetic regularity
1:20:51
21. Structure of set addition I: introduction to Freiman's theorem
1:14:36
22. Structure of set addition II: groups of bounded exponent and modeling lemma
1:19:57
23. Structure of set addition III: Bogolyubov's lemma and the geometry of numbers
1:18:06
24. Structure of set addition IV: proof of Freiman's theorem
1:19:31
25. Structure of set addition V: additive energy and Balog-Szemerédi-Gowers theorem
1:14:46
26. Sum-product problem and incidence geometry
1:14:14