18.217 | Fall 2019 | Graduate

Graph Theory and Additive Combinatorics

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

As Taught In
Fall 2019
Learning Resource Types
Lecture Videos
Problem Sets
Lecture Notes
Instructor Insights