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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e09d2b9ce05
DTSTART;TZID=America/Toronto:20220607T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220607T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-ronen-wdowinski
SUMMARY:Graphs and Matroids Seminar - Ronen Wdowinski
CLASS:PUBLIC
DESCRIPTION:TITLE: Linear arboricity of sparse multigraphs via orientations
 \n\nSpeaker:\n Ronen Wdowinski\n\nAffiliation:\n University of Waterloo\n\
 nRoom:\n MC 5417\n\nABSTRACT:\n\nThe linear arboricity $la(G)$ of a loople
 ss multigraph $G$ is the\nminimum number of colors required to edge-color 
 $G$ into linear\nforests\, that is\, forests whose components are all path
 s. The Linear\nArboricity Conjecture of Akiyama\, Exoo\, and Harary assert
 s that the\nlinear arboricity of a simple graph $G$ is at most $\\lceil\n(
 \\Delta(G)+1)/2 \\rceil$.
DTSTAMP:20260416T082619Z
END:VEVENT
END:VCALENDAR