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

Name: Lecture 10: Szemerédi’s Graph Regularity Lemma V: Hypergraph Removal and Spectral Proof
Uploaded: 2020-05-12T18:00:04Z
Duration: 1 h 19 min 14 s
Description: 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: Prof. Yufei Zhao

1:19:14

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: Prof. Yufei Zhao