Topics in Extremal and Probabilistic Combinatorics

This course will cover advanced topics and recent developments in extremal and probabilistic combinatorics,  and will feature a large number of classes by visitors taking part  in the Com- binatorics  semester.   Possible topics  of discussion include  extremal  graph  theory,  Ramsey theory,  random  graphs and processes, additive  combinatorics,  structural graph theory,  per- colation,  scale-free networks,  algebraic and topological methods,  and applications  to areas such as computer  science and statistical physics.

[1] N. Alon and  J.  H. Spencer. The  probabilistic  method,  3rd edition,  Wiley, New York, 2008.
[2] B. Bollobas, Modern Graph Theory (Graduate Texts in Mathematics), Springer-Verlag, New York, 1998.