BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Compressions in Extremal Combinatorics - Ben Barber (DPMMS)
DTSTART:20120304T111500Z
DTEND:20120304T114500Z
UID:TALK36729@talks.cam.ac.uk
CONTACT:Mary Fortune
DESCRIPTION:How big can a family of finite sets satisfying some property b
 e?  One obstacle to answering this type of question is a lack of structure
 . _Compressions_ are one way of imposing structure on families of sets. Wh
 at are they\, and what can we use them to find out?\n
LOCATION:Winstanley Lecture Theatre\, Trinity College
END:VEVENT
END:VCALENDAR