Tight cycles in hypergraphs
Shoham Letzter (University College London)
02-Sep-2021, 14:15-16:00 (3 years ago)
Abstract: How many edges can an r-uniform hypergraph on n vertices with no tight cycles have? We determine the correct answer to this question up to a polylogarithmic factor, improving on a recent result by Sudakov and Tomon.
computational geometrydiscrete mathematicscommutative algebracombinatorics
Audience: researchers in the topic
Copenhagen-Jerusalem Combinatorics Seminar
Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.
The password for the zoom room is 123456
Organizers: | Karim Adiprasito, Arina Voorhaar* |
*contact for this listing |
Export talk to