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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7c849a9f2
DTSTART;TZID=America/Toronto:20240702T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240702T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-bertrand-guenin
SUMMARY:Graphs and Matroids - Bertrand Guenin
CLASS:PUBLIC
DESCRIPTION:TITLE: A relaxation of Woodall’s conjecture\n\nSPEAKER:\n Be
 rtrand Guenin\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 5
 479\n\nABSTRACT: In a directed graph\, a directed cut (dicut for short) i
 s a\ncut where all arcs are directed from one shore to the other\; a\ndire
 cted join (dijoin for short) is a set of arcs whose contraction\nmakes the
  digraph strongly connected. The celebrated\nLucchesi–Younger theorem st
 ates that for any directed graph the size\nof the smallest dijoin equals t
 he maximum number of pairwise disjoint\ndicuts. Woodall’s conjecture pos
 its that the size of the smallest\ndicut equals the maximum number of pair
 wise disjoint dijoins. 
DTSTAMP:20260403T083828Z
END:VEVENT
END:VCALENDAR