The previous lecture in this series is here. The next lecture in this series is here.
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.
These videos are of a lecture course by Yufei Zhao at the Massachusetts Institute of Technology in 2019, and made available as part of its OpenCourseWare initiative. The website for the course may be found here.