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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6827af921596a
DTSTART;TZID=America/Toronto:20241203T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241203T150000
URL:/combinatorics-and-optimization/events/graphs-and-m
 atroids-sepehr
SUMMARY:Graphs and Matroids - Sepehr
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: The pathwidth theorem for induced subgraphs\
 n\nSPEAKER:\n Sepehr\n\nAFFILIATION:\n University of À¶Ý®ÊÓƵ\n\nLOCATION:
 \n MC 5417\n\nABSTRACT: We present a full characterization of the unavoida
 ble\ninduced subgraphs of graphs with large pathwidth. This consists of tw
 o\nresults. The first result says that for every forest H\, every graph of
 \nsufficiently large pathwidth contains either a large complete\nsubgraph\
 , a large complete bipartite induced minor\, or an induced\nminor isomorph
 ic to H. The second result describes the unavoidable\ninduced subgraphs of
  graphs with a large complete bipartite induced\nminor. If time permits \,
  we will also try to discuss the proof of the\nfirst result mentioned abov
 e.\n\nBased on joint work with Maria Chudnovsky and Sophie Spirkl.\n 
DTSTAMP:20250516T213514Z
END:VEVENT
END:VCALENDAR