Combinatorics (Fall 2010)/The Szemeredi regularity lemma

From TCS Wiki
Revision as of 07:22, 31 December 2010 by 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…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
  • 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.
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Combinatorics_(Fall_2010)/The_Szemeredi_regularity_lemma&oldid=4401"