09w5035 Probabilistic and Extremal Combinatorics

Arriving Sunday, August 23 and departing Friday, August 28, 2009

Organizers: Michael Krivelevich (Tel Aviv University), Bruce Reed (McGill University), Benny Sudakov (University of California, Los Angeles).

Confirmed Participants

Press Release: Probabilistic and Extremal Combinatorics

Information for Participants

Schedule (PDF file)

Mailing List

Final Report (PDF file)

Workshop Videos

Objectives

The workshop will focus specifically on several major research topics in modern Combinatorics. These topics include Extremal Problems for Graphs and Set Systems, Ramsey Theory, Combinatorial Number Theory, Combinatorial Geometry, Random Graphs, Probabilistic Methods. We aim to foster interaction between researchers in these rather diverse fields, to discuss recent progress and to communicate new results. We would also like to put an emphasis on the exchange of ideas, approaches and techniques between Probabilistic and Extremal Combinatorics. We also expect the participants to have many fruitful discussions that will lead to new ideas and joint research. Another aim is to use this forum to make state-of-the-art probabilistic and extremal techniques available to a broader audience, in particular to graduate students.

Given the fast development in recent years of probabilistic and extremal techniques and their applications to various disciplines in mathematics and outside it, it seems an appropriate time to bring together researchers representing the whole spectrum of Probabilistic and Extremal Combinatorics, so as to consolidate our knowledge at present and set new horizons for future discoveries.