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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a01a5ae4e61c
DTSTART;TZID=America/Toronto:20260515T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260515T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-jim-geelen-tangles-graphs-and-matroids
SUMMARY:Tutte Colloquium -Jim Geelen-Tangles in graphs and matroids
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Jim Geelen\n\nAFFILIATION:\n University of Waterloo\
 n\nLOCATION:\n MC 5501\n\nABSTRACT: A common strategy in many proofs and 
 algorithms is to begin\nby decomposing a graph into more highly connected 
 pieces.\nDecomposition is easy when the goal is to obtain connected or\n2-
 connected pieces\, and decomposition into 3- or 4-connected pieces is\nals
 o straightforward in many settings. For higher levels of\nconnectivity\, h
 owever\, no effective and widely applicable notion of\ndecomposition is cu
 rrently known. To address this\, Robertson and\nSeymour introduced _tangl
 es_\, which capture the k-connected regions\nof a graph without decomposin
 g. 
DTSTAMP:20260511T094726Z
END:VEVENT
END:VCALENDAR