The previous lecture in this series is here. The next lecture in this series is here.
In this first half of this lecture, Prof. Zhao shows how to prove Szemerédi’s theorem using the hypergraph removal lemma, as well as a discussion of the hypergraph regularity method. In the second half, he discusses a spectral graph theoretic proof of Szemerédi’s 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.