1:00:047. Szemerédi's graph regularity lemma II: triangle removal lemma
From the creator
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Continuing the discussion of Szemerédi's graph regularity lemma, Prof. 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. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu
Published 2020-05-12 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.





