Video Lectures
Lecture 8: Szemerédi’s Graph Regularity Lemma III: Further Applications
Viewing videos requires an internet connection
Description: After proving Roth’s theorem last lecture, Professor Zhao explains Behrend’s construction of large sets of integers without 3term arithmetic progressions, as well as another application of the triangle removal lemma to subsets of a 2dimensional lattice without corners.
The second half of the lecture discusses further applications of the regularity method within graph theory: graph embedding, counting, and removal lemmas, as well as a proof of the Erdős–Stone–Simonovits theorem on Hfree graphs.
Instructor: Yufei Zhao
Transcript
Instructor:  
Course Number: 

Departments:  
As Taught In:  Fall 2019 
Level: 
Graduate

Learning Resource Types
theaters
Lecture Videos
assignment
Problem Sets
notes
Lecture Notes
Instructor Insights