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:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d45ef53df7c
DTSTART;TZID=America/Toronto:20251110T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251110T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-mathieu-rundstrom
SUMMARY:Graphs and Matroids - Mathieu Rundstrom
CLASS:PUBLIC
DESCRIPTION:TITLE:Almost Regular Matroids\n\nSPEAKER:\n Mathieu Rundstrom\n
 \nAFFILIATION:\n University of Waterloo\n\nROOM:\n MC 6029\n\nABSTRACT: R
 egular matroids form an important and extensively studied\nclass of matroi
 ds and have numerous known descriptions and\ncharacterizations. In the 198
 0s\, Truemper gave a constructive\ndescription of the related class of _a
 lmost regular matroids_:\nnon-regular matroids $M$ such that for every ele
 ment $e$ of $M$ either\n$M/e$ or $M\\backslash e$ is regular. In this talk
 \, we present a\ndescription of almost regular matroids in terms of grafts
 . A\nconsequence of this description is that almost regular matroids have\
 nbounded complexity. We outline some of the proof ideas after\nintroducing
  the necessary background.
DTSTAMP:20260407T013341Z
END:VEVENT
END:VCALENDAR