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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6870d0ff0e84a
DTSTART;TZID=America/Toronto:20231117T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231117T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-luke-postle-2
SUMMARY:Tutte Colloquium - Luke Postle
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Hypergraph Matchings Avoiding Forbidden Sub
 matchings\n\nSpeaker:\n Luke Postle\n\nAffiliation:\n University of Waterl
 oo\n\nLocation:\n MC 5501\n\nABSTRACT: We overview a general theory for 
 finding perfect or almost\nperfect matchings in a hypergraph G avoiding a 
 given set of forbidden\nsubmatchings (which we view as a hypergraph H wher
 e V(H)=E(G)).\n 
DTSTAMP:20250711T085319Z
END:VEVENT
END:VCALENDAR