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

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
Instructor: Yufei Zhao
View the complete course: ocw.mit.edu/18...
TH-cam Playlist: • MIT 18.217 Graph Theor...
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 ocw.mit.edu/terms
More courses at ocw.mit.edu

[@ozuromo]

Really well explained.

[@priscilla6865]

great lecture

[@suzikihimesama]

GOAT!