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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf6ba013eca
DTSTART;TZID=America/Toronto:20241104T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241104T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-he-guo
SUMMARY:Algebraic Graph Theory-He Guo
CLASS:PUBLIC
DESCRIPTION:TITLE: Intersection of Matroids\n\nSPEAKER:\n He Guo\n\nAFFILIA
 TION:\n Umeå University\n\nLOCATION:\n Please contact Sabrina Lato for 
 Zoom link.\n\nABSTRACT: We study simplicial complexes (hypergraphs closed 
 under\ntaking subsets) that are the intersection of a given number k of\nm
 atroids. We prove bounds on their chromatic numbers (the minimum\nnumber o
 f edges required to cover the ground set) and their list\nchromatic number
 s. Settling a conjecture of Kiraly and\nBerczi--Schwarcz--Yamaguchi\, we p
 rove that the list chromatic number\nis at most k times the chromatic numb
 er. The tools used are in part\ntopological. If time permits\, I will also
  discuss a result proving\nthat the list chromatic number of the intersect
 ion of two matroids is\nat most the sum of the chromatic numbers of each 
 matroid\, improving a\nresult by Aharoni and Berger from 2006. The talk is
  based on works\njoint with Ron Aharoni\, Eli Berger\, and Daniel Kotlar. 
 In this talk\,\nthere is no assumption about background knowledge of matro
 id theory or\nalgebraic topology.
DTSTAMP:20260403T072624Z
END:VEVENT
END:VCALENDAR