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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7cd94f3a8
DTSTART;TZID=America/Toronto:20240924T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240924T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-james-davies
SUMMARY:Graphs and Matroids - James Davies
CLASS:PUBLIC
DESCRIPTION:TITLE: Non-measurable colourings avoiding large distances\n\nSP
 EAKER:\n James Davies\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION
 :\n MC 5417\n\nABSTRACT: \"In 1983\, F{\\\"u}rstenberg\, Katznelson\, and 
 Weiss proved that\nfor every finite measurable colouring of the plane\, th
 ere exists a\n$d_0$ such that for every $d \\ge d_0$ there is a monochroma
 tic pair of\npoints at distance $d$. In contrast to this\, we show that th
 ere is a\nfinite colouring avoiding arbitrarily large distances.\n\nJoint 
 work with Rutger Campbell.\"
DTSTAMP:20260403T083953Z
END:VEVENT
END:VCALENDAR