BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:One way cuts in oriented graphs - Simon Griffiths
DTSTART:20080213T140000Z
DTEND:20080213T150000Z
UID:TALK10751@talks.cam.ac.uk
CONTACT:Anton Evseev
DESCRIPTION:Does every oriented graph have a large subgraph consisting of 
 edges all\ngoing in one direction? We'll investigate combinatorial questio
 ns of this\nsort using simple probabilistic methods. I will give an brief 
 introduction\nto probabilistic combinatorics before moving onto the result
 s about\noriented graphs\, so hopefully everything should be understandabl
 e to\neveryone.
LOCATION:MR4\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR