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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d45ef7b24c8
DTSTART;TZID=America/Toronto:20250722T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250722T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-nathan-bowler
SUMMARY:Graphs and Matroids - Nathan Bowler
CLASS:PUBLIC
DESCRIPTION:TITLE: Circuit partitions of finitary binary matroids\n\nSPEAK
 ER:\n Nathan Bowler\n\nAFFILIATION:\n University of Hamburg\n\nROOM:\n MC
  6483\n\nABSTRACT: Nash-Williams showed in 1960 that a (possibly infinite
 )\ngraph can be expressed as a union of edge-disjoint cycles if and only\n
 if it has no odd cut. Recently\, Joó extended this result to directed\ngr
 aphs\, showing that a directed graph can be expressed as a union of\nedge-
 disjoint directed cycles if and only if every cut contains the\nsame numbe
 r of edges in each direction. We extend these results to\nfinitary binary 
 matroids. This is joint work with Attila Joó.
DTSTAMP:20260407T013343Z
END:VEVENT
END:VCALENDAR