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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ceac0e42908
DTSTART;TZID=America/Toronto:20190524T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190524T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-mikhail-isaev
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Mikhail Isaev
CLASS:PUBLIC
DESCRIPTION:TITLE: The sandwich conjecture of random regular graphs and mo
 re\n\nSpeaker:\n Mikhail Isaev\n\nAffiliation:\n Monash University\n\nRoom
 :\n MC 5501\n\nABSTRACT:\n\nThe sandwich conjecture formulated in [Kim\, V
 u\, Advances in Math.\,\n2004] states that if d >> log n\, then the rando
 m d-regular graph on n\nvertices R(n\, d) can asymptotically almost surely
  be ”sandwiched”\nbetween G(n\, p1) and G(n\, p2) where probabilities 
 p1 and p2 are both\n(1 + o(1))d/n.
DTSTAMP:20260402T174902Z
END:VEVENT
END:VCALENDAR