BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Judicious partitions of hypergraphs - John Haslegrave (University 
 of Cambridge)
DTSTART:20110310T150000Z
DTEND:20110310T160000Z
UID:TALK30108@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:Judicious partitioning problems on hypergraphs seek to find pa
 rtitions of the vertex set such that a given parameter is reasonably large
  for every part. Typically we ask for the maximum value which can be achei
 ved for any hypergraph. Bollobas and Thomason conjectured that for a parti
 cular problem on r-uniform hypergraphs the worst case is given by the comp
 lete hypergraph on 2r-1 vertices\; we prove this conjecture in the case r=
 3.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR