18.217 | Fall 2019 | Graduate

Graph Theory and Additive Combinatorics

Video Lectures

Lecture 6: Szemerédi’s Graph Regularity Lemma I: Statement and Proof

Description: Szemerédi’s graph regularity lemma is a powerful tool in graph theory that gives a rough structural characterization of all large dense graphs. In this lecture, Professor Zhao explains the statement and proof of the regularity lemma.

Instructor: Yufei Zhao

Course Info

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