Combinatorics (Fall 2010)/The Szemeredi regularity lemma: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>WikiSysop
No edit summary
imported>WikiSysop
m (Protected "Combinatorics (Fall 2010)/The Szemeredi regularity lemma" ([edit=sysop] (indefinite) [move=sysop] (indefinite)))
 
(No difference)

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]
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Combinatorics_(Fall_2010)/The_Szemeredi_regularity_lemma&oldid=4407"