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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7e2e0d85f
DTSTART;TZID=America/Toronto:20181122T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181122T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-richard-lang
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 17 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar- Richard Lang
CLASS:PUBLIC
DESCRIPTION:TITLE: The upper density of monochromatic infinite paths\n\nSpe
 aker:\n Richard Lang\n\nAffiliation:\n University of Waterloo\n\nRoom:\n M
 C 5417\n\nABSTRACT: Given a complete graph $K_n$\, whose edges are coloure
 d in\nred and blue\, what is the longest monochromatic path one can find?
DTSTAMP:20260403T084534Z
END:VEVENT
END:VCALENDAR