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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0eebdada13
DTSTART;TZID=America/Toronto:20240227T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240227T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-aristotelis-chaniotis
SUMMARY:Graphs and Matroids - Aristotelis Chaniotis
CLASS:PUBLIC
DESCRIPTION:TITLE: Intersections of graphs and χ-boundedness: Interval gra
 phs\,\nchordal graphs\, and χ-guarding graph classes \n\nSPEAKER:\n Arist
 otelis Chaniotis\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n M
 C 5417\n\nABSTRACT: Following A. Gyárfás (1987)\, we say that a heredita
 ry\nclass of graphs is χ-bounded if there exists a function which\nprovid
 es an upper bound for the chromatic number of each graph of the\nclass in 
 terms of the graph's clique number. In this terminology\, E.\nAsplund and 
 B.Grünbaum (1960)\,  motivated by a question of A.\nBielecski (1948)\, p
 roved that the class of intersection graphs of axis\nparallel rectangles i
 s χ-bounded\, and J. P. Burling\, in his Ph.D.\nthesis (1965)\, proved th
 at the class of intersection graphs of axis\nparallel boxes in R^3 is not 
 χ-bounded.
DTSTAMP:20260404T105805Z
END:VEVENT
END:VCALENDAR