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:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ddcccd4ebd1
DTSTART;TZID=America/Toronto:20230707T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230707T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/distinguishe
 d-tutte-lecture-jacob-fox
SUMMARY:Distinguished Tutte Lecture - Jacob Fox
CLASS:PUBLIC
DESCRIPTION:TITLE: Ramsey Cayley graphs\, random graph models\, and inform
 ation\ntheory\n\nSpeaker:\n Jacob Fox\n\nAffiliation:\n Stanford Universit
 y\n\nLocation:\n MC 5501\n\nABSTRACT: A graph is Ramsey if its largest cl
 ique or independent set\nis of size logarithmic in the number of vertices.
  While almost all\ngraphs are Ramsey\, there is still no known explicit co
 nstruction of\nRamsey graphs. Alon conjectured that every finite group has
  a Ramsey\nCayley graph.
DTSTAMP:20260414T051245Z
END:VEVENT
END:VCALENDAR