Decompositions of Hypergraphs
Felix Joos (Heidelberg University)
10-Aug-2020, 14:00-15:00 (4 years ago)
Abstract: Several results on approximate decompositions of hypergraphs are presented including decompositions into tight Hamilton cycles under very mild assumptions on the host hypergraphs as well as further results on decompositions of quasirandom hypergraphs into bounded degree hypergraphs.
combinatoricsprobability
Audience: researchers in the topic
Extremal and probabilistic combinatorics webinar
Series comments: We've added a password: concatenate the 6 first prime numbers (hence obtaining an 8-digit password).
Organizers: | Jan Hladky*, Diana Piguet, Jan Volec*, Liana Yepremyan |
*contact for this listing |
Export talk to