BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Hypergraph $F$-designs exist for arbitrary $F$ Osthus, Deryk


We show that given any $r$-uniform hypergraph $F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of any sufficiently large complete $r$-uniform hypergraph into edge-disjoint copies of $F$. The case when $F$ is complete corresponds to the existence of block designs, a problem going back to the 19th century, which was recently settled by Keevash. In particular, our argument provides a new proof of this result, which employs purely probabilistic and combinatorial methods. We also obtain several further generalizations. (Joint work with Stefan Glock, Daniela Kuhn and Allan Lo.)

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International