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:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68279dbdce303
DTSTART;TZID=America/Toronto:20180126T093000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180126T093000
URL:/combinatorics-and-optimization/events/special-semi
 nar-sophie-spirkl
SUMMARY:Special Seminar - Sophie Spirkl
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Sparse graphs with forbidden induced subgra
 phs and the\nErdos-Hajnal conjecture\n\nSpeaker:\n Sophie Spirkl\n\nAffili
 ation:\n Princeton University\n\nRoom:\n MC 5501\n\nAbstract:\n\nA graph G
  is called H-free if it does not contain H as an induced\nsubgraph\, i.e. 
 H cannot be obtained from G by deleting vertices. A\nfamous conjecture due
  to Erdos and Hajnal states that for every graph\nH\, there is a constant 
 c > 0 such that in every n-vertex H-free graph\nG\, there is a set of nc v
 ertices that are either all pairwise adjacent\nor all pairwise non-adjacen
 t.\n 
DTSTAMP:20250516T201909Z
END:VEVENT
END:VCALENDAR