Video Lectures
Lecture 6: Szemerédi’s Graph Regularity Lemma I: Statement and Proof
Viewing videos requires an internet connection
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
Learning Resource Types
theaters
Lecture Videos
assignment
Problem Sets
notes
Lecture Notes
Instructor Insights
