BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrey Kupavskii (Moscow Institute of Physics and Technology)
DTSTART:20201102T140000Z
DTEND:20201102T150000Z
DTSTAMP:20260423T035541Z
UID:EPC/33
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/33/">The
  extremal number of surfaces</a>\nby Andrey Kupavskii (Moscow Institute of
  Physics and Technology) as part of Extremal and probabilistic combinatori
 cs webinar\n\n\nAbstract\nIn 1973\, Brown\, Erdős and Sós proved that if
  H is a 3-uniform hypergraph on n vertices which contains no triangulation
  of the sphere\, then H has at most $O(n^{5/2})$ edges\, and this bound is
  the best possible up to a constant factor. Resolving a conjecture of Lini
 al\, also reiterated by Keevash\, Long\, Narayanan\, and Scott\, we show t
 hat the same result holds for triangulations of the torus. Furthermore\, w
 e extend our result to every closed orientable surface S. Joint work with 
 Alexandr Polyanskii\, István Tomon and Dmitriy Zakharov\n
LOCATION:https://researchseminars.org/talk/EPC/33/
END:VEVENT
END:VCALENDAR