18.318 - Topics in Combinatorics : Extremal Combinatorics (Spring 2015)

 

Syllabus

Syllabus

Lecture notes

Lectures 1-2 : Turan and Erdos-Stone theorem
Lectures 3-5 : Bipartite Turan problems
Lectures 6-8 : Regularity lemma and applications
Lectures 9-10 : Regularity lemma and applications II
Lectures 11-12 : Graph limits and flag algebra
Lectures 13-15 : Embedding large graphs
Lectures 16 : Removing regularity lemma
Lectures 17 : Dilworth's theorem, Sperner's lemma
Lectures 18-19 : Erdos-Ko-Rado, Kruskal-Katona, and Isoperimetric inequalities

Problem Sets

Problem Set 1 (due date : 3/10/15)
Problem Set 2 (due date : 4/16/15)
Problem Set 3 (due date : 5/14/15)

External Sources

Courses taught by David Conlon, Jacob Fox, Po-Shen Loh, Olof Sisask

References

N. Alon, J. Spencer, Probabilistic Method

B. Bollob\'as, Extremal Graph Theory

S. Jukna, Extremal Combinatorics