BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Large hypergraphs without tight cycles - Mr B. Janzer (Cambridge)
DTSTART:20220203T143000Z
DTEND:20220203T153000Z
UID:TALK169475@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:An r-uniform tight cycle of length k>r is a hypergraph with ve
 rtices v_1\,.\,v_k and hyperedges {v_i\,v_{i+1}\,.\,v_{i+r-1}} (for all i)
 \, with the indices taken modulo k. Sós\, and independently Verstraëte\,
  asked the following question: how many edges can there be in an n-vertex 
 r-uniform hypergraph if it contains no tight cycles of any length? In this
  talk I will review some known results\, and present recent progress on th
 is problem.
LOCATION:MR12
END:VEVENT
END:VCALENDAR