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:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf77816c149
DTSTART;TZID=America/Toronto:20250527T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250527T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-rebecca-whitman
SUMMARY:Graphs and Matroids - Rebecca Whitman
CLASS:PUBLIC
DESCRIPTION:TITLE: A hereditary generalization of Nordhaus-Gaddum graphs\n
 \nSPEAKER:\n Rebecca Whitman\n\nAFFILIATION:\n University of California\, 
 Berkeley\n\nROOM:\n MC 6483\n\nABSTRACT: This talk will be an expanded ve
 rsion of the speaker's\nCanaDAM talk\, the abstract of which is as follows
 :\n\nNordhaus and Gaddum proved in 1956 that the sum of the chromatic\nnum
 ber of a graph G and its complement is at most |G| + 1. The\nNordhaus-Gadd
 um graphs are the class of graphs satisfying this\ninequality with equalit
 y\, and are well-understood. In this paper we\nconsider a hereditary gener
 alization: graphs G for which all induced\nsubgraphs H of G satisfy that t
 he sum of the chromatic numbers of H\nand its complement are at least |H|.
  We characterize the forbidden\ninduced subgraphs of this class and find i
 ts intersection with a\nnumber of common classes\, including line graphs. 
 We also discuss\nchi-boundedness and algorithmic results.
DTSTAMP:20260403T081705Z
END:VEVENT
END:VCALENDAR