18.217 | Fall 2019 | Graduate

Graph Theory and Additive Combinatorics

Video Lectures

Lecture 13: Sparse Regularity and the Green-Tao Theorem

Description: After a brief discussion of Ramanujan graphs, Professor Zhao discusses one of his favorite topics (also the subject of his own PhD dissertation): the regularity method for sparse graphs and its application to the celebrated Green–Tao theorem that the primes contain arbitrarily long arithmetic progressions.

Instructor: Yufei Zhao

Course Info

As Taught In
Fall 2019
Learning Resource Types
Lecture Videos
Problem Sets
Lecture Notes
Instructor Insights