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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cfd0bf34152
DTSTART;TZID=America/Toronto:20220111T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220111T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-amena-assem
SUMMARY:Graphs and Matroids Seminar - Amena Assem
CLASS:PUBLIC
DESCRIPTION:TITLE: Edge-Disjoint Linkage in Infinite Graphs\n\nSpeaker:\n 
 Amena Assem\n\nAffiliation:\n University of Waterloo\n\nZoom:\n http://mat
 roidunion.org/?page_id=2477 or contact Shayla Redlin\n\nABSTRACT:\n\nIn 1
 980 Thomassen conjectured that\, for odd k\, an edge-connectivity of\nk is
  enough for a graph to be weakly k-linked\, meaning any k pairs of\ntermin
 als can be linked by k edge-disjoint paths. The best known\nresult to date
  for finite graphs is from 1991\, by Andreas Huck\, and\nassumes an edge-c
 onnectivity of k+1 for odd k.
DTSTAMP:20260403T143751Z
END:VEVENT
END:VCALENDAR