BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Hypergraph Ramsey numbers - David Conlon
DTSTART:20081205T140000Z
DTEND:20081205T150000Z
UID:TALK14650@talks.cam.ac.uk
CONTACT:Anton Evseev
DESCRIPTION:Let H be a k-uniform hypergraph. The Ramsey number r(H) is the
  smallest number n such that in any two-colouring of the edges of the comp
 lete k-uniform hypergraph K_n\, there is guaranteed to be a monochromatic 
 copy of H. We will discuss various new bounds for hypergraph Ramsey number
 s and\nrelated problems. This is joint work with Jacob Fox and Benny Sudak
 ov.
LOCATION:MR4\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR