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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d15befcd1ed
DTSTART;TZID=America/Toronto:20250530T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250530T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-lior-gishboliner
SUMMARY:Tutte colloquium-Lior Gishboliner
CLASS:PUBLIC
DESCRIPTION:TITLE:Regularity lemmas for hypergraphs of bounded VC dimension
 :\nimproved bounds\n\nSPEAKER:\n Lior Gishboliner\, \n\nAFFILIATION:\n Uni
 versity of Toronto\n\nLOCATION:\n MC 5501\n\nABSTRACT:An important result 
 at the interface of graph theory and\nlogic is that graphs of bounded VC d
 imension have (small) homogeneous\nvertex-partitions\, i.e.\, partitions w
 here almost every pair of parts\nhas density close to 0 or 1. Recently\, C
 hernikov and Towsner proved a\nhypergraph generalization of this fact. The
  quantitative aspects of\ntheir result remain open. I will present some re
 cent progress on this\nproblem\, answering two questions of Terry. This is
  a joint work with\nAsaf Shapira and Yuval Wigderson.\n\n 
DTSTAMP:20260404T184359Z
END:VEVENT
END:VCALENDAR