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:69ce7da186240
DTSTART;TZID=America/Toronto:20231117T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231117T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-luke-postle-2
SUMMARY:Tutte Colloquium - Luke Postle
CLASS:PUBLIC
DESCRIPTION:TITLE: Hypergraph Matchings Avoiding Forbidden Submatchings\n\
 nSpeaker:\n Luke Postle\n\nAffiliation:\n University of Waterloo\n\nLocati
 on:\n MC 5501\n\nABSTRACT: We overview a general theory for finding perf
 ect or almost\nperfect matchings in a hypergraph G avoiding a given set of
  forbidden\nsubmatchings (which we view as a hypergraph H where V(H)=E(G))
 .
DTSTAMP:20260402T143057Z
END:VEVENT
END:VCALENDAR