X

About this post

Source
Author
Date
1:35 AM | December 04, 2012
Language
English
Categories
URL
Link to this page


Editor's Pick
Perhaps the most important structural result about general large dense graphs is the Szemerédi regularity lemma. Here is a standard formulation of that lemma: Lemma 1 (Szemerédi regularity lemma) Let be a graph on vertices, and let . Then there exists a partition for some with the property that for all but at most of [...]

Tags

Comments

pkrautz2012-12-10 06:44:22
User Avatar
A proof of one of the most celebrated tools in modern mathematics, explained by Terry Tao.

Log in to leave a comment