Prerequisite: None- Basic Knowledge of Graph Theory Helpful.
The course discusses Szemeredi's Regularity Lemma and its applications in graph theory and additive combinatorics.
The course mark will be based entirely on student presentations.
All courses materials will be available here.
Tao-Vu Extract , NOW READABLE. Some of the comments may be obscure due to notation. The definitions on regular pairs and the statement of the Regularity Lemma are acessible. This is all you absolutely need. The rest, I hope is also accessible if you attended the lectures. Note they don't use the triangle removal lemma but a related lemma which only considers one regular pair (instead of 3).
Exercise Set for Lecture on Tuesday January 11
Proof of The Alon Yuster Conjecture
Proof of The Posa-Seymour Conjecture
Gowers Regularity Lemma for 3-regular hypergraphs
Rodl's Regularity Lemma for hypergraphs
A Short Proof of The Hajnal Szemeredi Theorem
The Computational Complexity of Regular Partitions
Furstenberg's Proof of Szemeredi's Theorem