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 2: | Line 2: | ||
:*Chap 7.4: Szemerédi regularity lemma | :*Chap 7.4: Szemerédi regularity lemma | ||
:*Chap 7.5: Applying the 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. | * Komlós, Shokoufandeh, Simonovits, and Szemerédi. '''The Regularity Lemma and Its Applications in Graph Theory.''' ''Theoretical Aspects of Computer Science'', 2002. [[media:Regularity.applications.pdf|<nowiki>[</nowiki>PDF<nowiki>]</nowiki>]] | ||
Revision as of 07:26, 31 December 2010
- 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]