Peter Keevash (Universidade de Oxford, Inglaterra)
ENSPM 2022 Presentation
Title: Hypergraph decompositions and their applications
Abstract: Many combinatorial objects can be thought of as a hypergraph decomposition, i.e. a partition of (the edge set of) one hypergraph into (the edge sets of) copies of some other hypergraphs. For example, a Steiner Triple System is equivalent to a decomposition of a complete graph into triangles. In general, Steiner Systems are equivalent to decompositions of complete uniform hypergraphs into other complete uniform hypergraphs (of some specified sizes). The Existence Conjecture for Combinatorial Designs, which I proved in 2014, states that, bar finitely many exceptions, such decompositions exist whenever the necessary `divisibility conditions’ hold. I also obtained a generalisation to the quasirandom setting, which implies an approximate formula for the number of designs; in particular, this resolved Wilson’s Conjecture on the number of Steiner Triple Systems. A more general result that I proved in 2018 on decomposing lattice-valued vectors indexed by labelled complexes provides many further existence and counting results for a wide range of combinatorial objects, such as resolvable designs (the generalised form of Kirkman’s Schoolgirl Problem), whist tournaments or generalised Sudoku squares. In this talk, I plan to review this background and then describe some more recent and ongoing applications of these results and developments of the ideas behind them.