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

Course Info

Instructor
Departments
As Taught In
Fall 2023
Level
Learning Resource Types
Instructor Insights
Online Textbook
Lecture Videos
Lecture Notes
Problem Sets