BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Shoham Letzter (University College London)
DTSTART:20210902T141500Z
DTEND:20210902T160000Z
DTSTAMP:20260422T070026Z
UID:CJCS/25
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/25/">Ti
 ght cycles in hypergraphs</a>\nby Shoham Letzter (University College Londo
 n) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAbstract\nHo
 w many edges can an r-uniform hypergraph on n vertices with no tight cycle
 s have? We determine the correct answer to this question up to a polylogar
 ithmic factor\, improving on a recent result by Sudakov and Tomon.\n
LOCATION:https://researchseminars.org/talk/CJCS/25/
END:VEVENT
END:VCALENDAR