Video Lectures

Lecture 10: Szemerédi’s Graph Regularity Lemma V: Hypergraph Removal and Spectral Proof

Description: In this first half of this lecture, Professor 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.

Instructor: Yufei Zhao


Course Info

Learning Resource Types

theaters Lecture Videos
assignment Problem Sets
notes Lecture Notes
co_present Instructor Insights