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:69ce950ecfaaa
DTSTART;TZID=America/Toronto:20180126T093000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180126T093000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/special-semi
 nar-sophie-spirkl
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Special Seminar - Sophie Spirkl
CLASS:PUBLIC
DESCRIPTION:TITLE: Sparse graphs with forbidden induced subgraphs and the\
 nErdos-Hajnal conjecture\n\nSpeaker:\n Sophie Spirkl\n\nAffiliation:\n Pri
 nceton 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 an
 d Hajnal states that for every graph\nH\, there is a constant c > 0 such t
 hat in every n-vertex H-free graph\nG\, there is a set of nc vertices that
  are either all pairwise adjacent\nor all pairwise non-adjacent.
DTSTAMP:20260402T161054Z
END:VEVENT
END:VCALENDAR