BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrey Kupavskii (CNRS\, G-SCOP)
DTSTART;VALUE=DATE-TIME:20201210T130000Z
DTEND;VALUE=DATE-TIME:20201210T140000Z
DTSTAMP;VALUE=DATE-TIME:20210124T161731Z
UID:DCGParis/1
DESCRIPTION:Title: The extremal number of surfaces\nby Andrey Kupavskii (C
NRS\, G-SCOP) as part of Discrete and Computational Geometry Seminar in Pa
ris\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 be
st possible up to a constant factor. Resolving a conjecture of Linial\, al
so reiterated by Keevash\, Long\, Narayanan\, and Scott\, we show that the
same result holds for triangulations of the torus. Furthermore\, we exten
d our result to every closed orientable surface S. Joint work with Alexand
r Polyanskii\, István Tomon and Dmitriy Zakharov.\n
END:VEVENT
END:VCALENDAR