BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A generalization of the off-diagonal Ramsey numbers - Oliver Janze
 r
DTSTART:20190224T162000Z
DTEND:20190224T165500Z
UID:TALK120796@talks.cam.ac.uk
CONTACT:73969
DESCRIPTION:The Ramsey number R(s\,t) stands for the smallest positive int
 eger N such that whenever the edges of the complete graph on N vertices ar
 e 2-coloured with red and blue\, then there is a red clique on s vertices 
 or a blue clique on t vertices. In this talk\, I will review the known res
 ults about this function\, mentioning some famous open problems. I will al
 so talk about how random graphs can be used to prove lower bounds on R(s\,
 t). Then I will present a generalisation of this function and state a rece
 nt result of Gowers and myself\, which is based on an unusual random graph
  construction.`
LOCATION:Winstanley Lecture Theatre\, Trinity College
END:VEVENT
END:VCALENDAR