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:69cf7aba98d46
DTSTART;TZID=America/Toronto:20240930T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240930T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-alexey-gordeev
SUMMARY:Algebraic Graph Theory-Alexey Gordeev
CLASS:PUBLIC
DESCRIPTION:TITLE: Combinatorial Nullstellensatz and the Erdős box problem
 \n\nSPEAKER:\n Alexey Gordeev\n\nAFFILIATION:\n Umeå University\n\nLOCATI
 ON:\n Please contact Sabrina Lato for Zoom link.\n\nABSTRACT: In the tal
 k\, I will show how Lasoń’s generalization of\nAlon’s Combinatorial N
 ullstellensatz can be used to obtain lower\nbounds on Turán numbers of co
 mplete r-partite r-uniform hypergraphs.\nAs an example\, I will give a sho
 rt and simple explicit construction of\na hypergraph free of copies of the
  complete r-partite r-uniform \nhypergraph with parts of size 2\, thereby
  providing a lower bound for\nthe so-called Erdős box problem. This asymp
 totically matches best\nknown bounds when r ≤ 4. 
DTSTAMP:20260403T083050Z
END:VEVENT
END:VCALENDAR