18.217 | Fall 2019 | Graduate

Graph Theory and Additive Combinatorics

Video Lectures

Lecture 7: Szemerédi’s Graph Regularity Lemma II: Triangle Removal Lemma

Description: Continuing the discussion of Szemerédi’s graph regularity lemma, Professor Zhao explains the triangle counting lemma, as well as the 3-step recipe (partition, clean, count) for applying the regularity method. Two applications are shown: the triangle removal lemma, and the graph theoretic proof of Roth’s theorem concerning sets without 3-term arithmetic progressions.

Instructor: Yufei Zhao

Course Info

As Taught In
Fall 2019
Learning Resource Types
Lecture Videos
Problem Sets
Lecture Notes
Instructor Insights