Combinatorics (Fall 2010)/The Szemeredi regularity lemma: Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop (Created page with '* 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…') |
imported>WikiSysop m (Protected "Combinatorics (Fall 2010)/The Szemeredi regularity lemma" ([edit=sysop] (indefinite) [move=sysop] (indefinite))) |
||
| (5 intermediate revisions by the same user not shown) | |||
| 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 | ||
:*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>]] | ||
* Marcus. '''The Szemerédi Regularity Lemma''' (in the presence of an asymptotically small rug). 2008. [http://cs-www.cs.yale.edu/homes/marcus/papers/srl.pdf <nowiki>[</nowiki>PDF<nowiki>]</nowiki>] | |||
* Trevisan. '''Additive Combinatorics and Theoretical Computer Science.''' 2009. [http://www.cs.berkeley.edu/~luca/pubs/addcomb-sigact.pdf <nowiki>[</nowiki>PDF<nowiki>]</nowiki>] | |||
Latest revision as of 10:20, 4 January 2011
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]