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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6af77aead3ba0
DTSTART;TZID=America/Toronto:20261120T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261120T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-andy-zucker-survey-structural-ramsey-theory
SUMMARY:Tutte Colloquium | Andy Zucker\, A survey of structural Ramsey theo
 ry
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Andy Zucker\n\nAFFILIATION:\n University of Waterloo
 \n\nLOCATION:\n MC 5501\n\nABSTRACT: Ramsey's celebrated theorem has two 
 forms — an infinite\nversion and a finite one. A natural way to try to g
 eneralize the\ntheorem is to color substructures of a given structure\, ra
 ther than\njust subsets of a given set. A 1977 theorem of Nesetril and Rod
 l\nprovides a sweeping generalization of the finite version of Ramsey's\nt
 heorem to all relational free-amalgamation classes of finite\nstructures. 
 For the infinite version\, things get much more\ncomplicated. While a 2022
  theorem of mine proves a generalization of\nthe infinite version for fini
 tely-constrained binary free-amalgamation\nclasses\, the result in full ge
 nerality is false dropping either the\nfinite-constraint assumption or the
  binary assumption. Time\npermitting\, I will discuss joint work with Joey
  Lakerdas-Gayle\ndiscussing some of the strange things that can happen for
 \ninfinitely-constrained binary free-amalgamation classes.   
DTSTAMP:20261113T210234Z
END:VEVENT
END:VCALENDAR