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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7ceca5fdd
DTSTART;TZID=America/Toronto:20240723T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240723T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-hidde-koerts
SUMMARY:Graphs and Matroids - Hidde Koerts
CLASS:PUBLIC
DESCRIPTION:TITLE: Intersections of graphs and χ-boundedness: characteriz
 ing\nχ-guarding graph classes\n\nSPEAKER:\n Hidde Koerts\n\nAFFILIATION:\
 n University of Waterloo\n\nLOCATION:\n MC 5479\n\nABSTRACT: For two grap
 hs _G1_\, _G2_\, their intersection is given by\nonly keeping the vertices
  and edges that appear in both. This graph\noperation is closely related t
 o various intersection graph classes\,\nsuch as the intersection graphs of
  axis-aligned rectangles. We are\ninterested in the interplay between the 
 graph intersection operation\nand χ-boundedness. A graph class _C_  is 
 χ-bounded if there exists\na function providing an upper bound for the ch
 romatic number of each\ngraph in the class based on the graph’s clique n
 umber.
DTSTAMP:20260403T084012Z
END:VEVENT
END:VCALENDAR