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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ceb4b54cbd3
DTSTART;TZID=America/Toronto:20211008T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20211008T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-sophie-spirkl-0
SUMMARY:Tutte Colloquium - Sophie Spirkl
CLASS:PUBLIC
DESCRIPTION:TITLE: Induced subgraphs and treewidth\n\nSpeaker:\n Sophie Sp
 irkl\n\nAffiliation:\n University of Waterloo\n\nZoom:\n Please email Emm
 a Watson\n\nABSTRACT:\n\nTreewidth\, introduced by Robertson and Seymour i
 n the graph minors\nseries\, is a fundamental measure of the complexity of
  a graph. While\ntheir results give an answer to the question\, “what mi
 nors occur in\ngraphs of large treewidth?\,” the same question for induc
 ed subgraphs\nis still open. I will talk about some conjectures and recent
  results\nin this area.\n\nJoint work with Tara Abrishami\, Maria Chudnovs
 ky\, Cemil Dibek\, Sepehr\nHajebi\, Pawel Rzazewski\, Kristina Vuskovic.
DTSTAMP:20260402T182557Z
END:VEVENT
END:VCALENDAR