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

Learning1:19:14

10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof

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 In this first half of this lecture, Prof. Zhao shows how to prove Szemerédi's theorem using the hypergraph removal lemma, as well as a discussion of the hypergraph regularity method. In the second half, he discusses a spectral graph theoretic proof of Szemerédi's regularity lemma. 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