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

Name: Lecture 6: Szemerédi’s Graph Regularity Lemma I: Statement and Proof
Uploaded: 2020-05-12T18:00:23Z
Duration: 1 h 19 min 8 s
Description: 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: Prof. Yufei Zhao

1:19:08

Up Next

Lecture 7: Szemerédi’s Graph Regularity Lemma II: Triangle Removal Lemma

Continue

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