Video details loaded
HomeMIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019Lecture 13: Sparse Regularity and the Green-Tao Theorem

Lecture 13: Sparse Regularity and the Green-Tao Theorem

1:19:06

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