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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a34d9240badf
DTSTART;TZID=America/Toronto:20260626T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260626T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-rutger-campbell-excluded-minors-z3-gainable
SUMMARY:Tutte Colloquium -Rutger Campbell-The excluded minors for Z3 -gaina
 ble\nbiased graphs
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Rutger Campbell\n\nAFFILIATION:\n Institute for Basi
 c Science\, Korea\n\nLOCATION:\n MC 5501\n\nABSTRACT: A biased graph is a
  pair (G\,B) consisting of a graph G and\na collection B of “balanced
 \" cycles in G. Biased graphs arise\nnaturally as the cycles that have ide
 ntity weight in a group-labelling\nof arcs where opposite arcs have invers
 e weight. I present an excluded\nminor characterization for biased graphs 
 that have such a\ngroup-labelling over Z3.
DTSTAMP:20260619T055236Z
END:VEVENT
END:VCALENDAR