tubeshowcase●1,671,863 videos♡ My collection 0
← Learning

Learning1:21:21

8. Szemerédi's graph regularity lemma III: further applications

MIT OpenCourseWare ↗

From the creator

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX After proving Roth's theorem last lecture, Prof. Zhao explains Behrend's construction of large sets of integers without 3-term arithmetic progressions, as well as another application of the triangle removal lemma to subsets of a 2-dimensional 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 H-free graphs. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu

Published 2020-05-12 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.

Keep exploring Learning