MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
Instructor: Yufei Zhao
View the complete course: [ Ссылка ]
YouTube Playlist: [ Ссылка ]

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 [ Ссылка ]
More courses at [ Ссылка ]

свернуть