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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf2b543d33e
DTSTART;TZID=America/Toronto:20220308T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220308T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-sang-il-oum
SUMMARY:Graphs and Matroids Seminar - Sang-il Oum
CLASS:PUBLIC
DESCRIPTION:TITLE: Obstructions for matroids of path-width at most k and g
 raphs\nof linear rank-width at most k\n\nSpeaker:\n Sang-il Oum\n\nAffilia
 tion:\n Institute for Basic Science / KAIST\n\nZoom:\n Join via http://ma
 troidunion.org/?page_id=2477 or please\nemail Shayla Redlin\n\nABSTRACT:
 \n\nEvery minor-closed class of matroids of bounded branch-width can be\nc
 haracterized by a minimal list of excluded minors\, but unlike graphs\,\nt
 his list could be infinite in general. However\, for each fixed finite\nfi
 eld $\\mathbb F$\, the list contains only finitely many $\\mathbb\nF$-repr
 esentable matroids\, due to the well-quasi-ordering of $\\mathbb\nF$-repre
 sentable matroids of bounded branch-width under taking matroid\nminors [J.
  F. Geelen\, A. M. H. Gerards\, and G. Whittle (2002)].
DTSTAMP:20260403T025204Z
END:VEVENT
END:VCALENDAR