6. Szemerédi's graph regularity lemma I: statement and proof
6.4 هزار بار بازدید -
4 سال پیش
-
MIT 18.217 Graph Theory and
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: MIT 18.217 Graph Theory and Additive ...
Szemerédi's graph regularity lemma is a powerful tool in graph theory that gives a rough structural characterization of all large dense graphs. In this lecture, Prof. Zhao explains the statement and proof of the regularity lemma.
License: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Instructor: Yufei Zhao
View the complete course: https://ocw.mit.edu/18-217F19
YouTube Playlist: MIT 18.217 Graph Theory and Additive ...
Szemerédi's graph regularity lemma is a powerful tool in graph theory that gives a rough structural characterization of all large dense graphs. In this lecture, Prof. Zhao explains the statement and proof of the regularity lemma.
License: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
4 سال پیش
در تاریخ 1399/02/23 منتشر شده
است.
6,466
بـار بازدید شده