Combinatorics (Fall 2010)/The Szemeredi regularity lemma: Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop No edit summary |
imported>WikiSysop No edit summary |
||
Line 1: | Line 1: | ||
== Readings == | |||
* Diestel. G''raph Theory, <font color=red>3rd edition or later</font>.'' Springer-Verlag. (If you only have the 2nd edition you will miss all the cool stuff.) | * Diestel. G''raph Theory, <font color=red>3rd edition or later</font>.'' Springer-Verlag. (If you only have the 2nd edition you will miss all the cool stuff.) | ||
:*Chap 7.4: Szemerédi regularity lemma | :*Chap 7.4: Szemerédi regularity lemma |
Revision as of 07:33, 31 December 2010
Readings
- Diestel. Graph Theory, 3rd edition or later. Springer-Verlag. (If you only have the 2nd edition you will miss all the cool stuff.)
- Chap 7.4: Szemerédi regularity lemma
- Chap 7.5: Applying the regularity lemma
- Komlós, Shokoufandeh, Simonovits, and Szemerédi. The Regularity Lemma and Its Applications in Graph Theory. Theoretical Aspects of Computer Science, 2002. [PDF]
- Marcus. The Szemerédi Regularity Lemma (in the presence of an asymptotically small rug). 2008. [PDF]
- Trevisan. Additive Combinatorics and Theoretical Computer Science. 2009. [PDF]