Video details loaded
HomeMIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019Lecture 9: Szemerédi’s Graph Regularity Lemma IV: Induced Removal Lemma
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019

Video 9 of 10

Previous: Lecture 8: Szemerédi’s Graph Regularity Lemma III: Further ApplicationsNext: Lecture 10: Szemerédi’s Graph Regularity Lemma V: Hypergraph Removal and Spectral Proof

Lecture 9: Szemerédi’s Graph Regularity Lemma IV: Induced Removal Lemma

1:23:16

Up Next

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

Continue

Description: Professor Zhao explains a strengthening of the graph regularity method that is then used to prove the induced graph removal lemma. He also discusses applications of the regularity method in computer science to graph property testing.

Instructor: Prof. Yufei Zhao