BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:686a3dd772ff4
DTSTART;TZID=America/Toronto:20230929T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230929T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-nikhil-kumar
SUMMARY:Tutte Colloquium - Nikhil Kumar
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: An Approximate Generalization of the Okamur
 a-Seymour Theorem\n\nSpeaker:\n Nikhil Kumar\n\nAffiliation:\n University 
 of À¶Ý®ÊÓƵ\n\nLocation:\n MC 5501\n\nABSTRACT: We consider the problem o
 f multicommodity flows in planar\ngraphs. Okamura and Seymour showed that 
 if all the demands are\nincident on one face\, then the cut-condition is s
 ufficient for routing\ndemands.\n 
DTSTAMP:20250706T091151Z
END:VEVENT
END:VCALENDAR