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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e18c07bc604
DTSTART;TZID=America/Toronto:20210806T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210806T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-liana-yepremyan
SUMMARY:Tutte Colloquium - Liana Yepremyan
CLASS:PUBLIC
DESCRIPTION:TITLE: The size Ramsey numbers of graphs and hypergraphs\n\
 nSpeaker:\n Liana Yepremyan\n\nAffiliation:\n London School of Economics\n
 \nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nThe s-colour size-Ram
 sey number of a graph ( hypergraph) H is the\nminimum number of edges in 
 a graph (hypergraph) G whose every\ns-edge-colouring contains a monochroma
 tic copy of H. While the  \nstudy of size Ramsey numbers for graphs  
 goes back to 70's to the\nwork of Erdos\, Faudree\, Rousseau and Schelp\,
  the systematic study of\nthese numbers for hypergraphs have been initiat
 ed much more recently\nin 2017  by Dudek\, La Fleur\, Mubayi\, and Rödl
 . In this talk we will\npresent the current known results in the literatur
 e\, and some recent\nprogress we have made on several questions in the are
 a.
DTSTAMP:20260417T012527Z
END:VEVENT
END:VCALENDAR