Sets: theorems of Sperner, Erdös-Ko-Rado, Kruskal-Katona. Graphs: trees, chromatic number, planar graphs, extremal theorems of Turan, Kövári-Sós-Turán and Erdös-Stone. Ramsey theory. Random graphs. Szemeredi’s lemma and applications. Algebra and Topology Techniques in Combinatorics. Additive Combinatorics.

References:
BOLLOBÁS, B. – Modern Graph Theory, New York : Springer, c1998.
ALON, N., SPENCER, JOEL H. – The Probabilistic Method, 3rd ed. Hoboken, N.J.: Wiley, c2008.

Note: This course is offered as a master’s course. In the doctorate, it has additional requirements.

 

* Basic syllabus. The teacher has the autonomy to make any changes.