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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d153521b678
DTSTART;TZID=America/Toronto:20230123T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230123T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/nash-william
 s-orientation-conjecture-infinite-graphs-amena
SUMMARY:Nash-Williams Orientation Conjecture for Infinite Graphs - Amena As
 sem
CLASS:PUBLIC
DESCRIPTION:TITLE: Nash-Williams Orientation Conjecture for Infinite Graphs
 \n      \n\nSpeaker:\n Amena Assem\n\nAffiliation\n University of Wa
 terloo\n\nLocation:\n MC 5479\n\nABSTRACT: In 1960 Nash-Williams proved th
 at every 2k-edge-connected\nfinite graph admits a k-arc-connected orientat
 ion. He conjectured that\nthis is  also true for infinite graphs. We TRY 
 to prove the\nconjecture. Joint work with Bruce Richter.
DTSTAMP:20260404T180714Z
END:VEVENT
END:VCALENDAR