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: Prof. Yufei Zhao