BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrey Kupavskii (CNRS\, G-SCOP)
DTSTART:20201210T130000Z
DTEND:20201210T140000Z
DTSTAMP:20260423T040152Z
UID:DCGParis/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/DCGParis/1/"
 >The extremal number of surfaces</a>\nby Andrey Kupavskii (CNRS\, G-SCOP) 
 as part of Discrete and Computational Geometry Seminar in Paris\n\n\nAbstr
 act\nIn 1973\, Brown\, Erdős and Sós proved that if H is a 3-uniform hyp
 ergraph 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 Linial\, also reiterated 
 by Keevash\, Long\, Narayanan\, and Scott\, we show that the same result h
 olds for triangulations of the torus. Furthermore\, we extend our result t
 o every closed orientable surface S. Joint work with Alexandr Polyanskii\,
  István Tomon and Dmitriy Zakharov.\n
LOCATION:https://researchseminars.org/talk/DCGParis/1/
END:VEVENT
END:VCALENDAR