Tel-Aviv University
School of Mathematical Sciences

Department Colloquium

Monday, March 21, 2016

Schreiber 006, 12:15

David Conlon

University of Oxford

Recent developments in graph Ramsey theory

Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring of the edges of KN contains a monochromatic copy of H. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this talk, I will describe some of this progress.

Coffee will be served at 12:00 before the lecture
at Schreiber building 006