18.217 | Fall 2019 | Graduate

Graph Theory and Additive Combinatorics

Video Lectures

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

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

Course Info

Instructor
Departments
As Taught In
Fall 2019
Level
Graduate
Topics
Learning Resource Types
Lecture Videos
Problem Sets
Lecture Notes
Instructor Insights
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology