6. Szemerédi's graph regularity lemma I: statement and proof

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 Szemerédi's graph regularity lemma is a powerful tool in graph theory that gives a rough structural characterization of all large dense graphs. In this lecture, Prof. Zhao explains the statement and proof of the regularity lemma. 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.