Graph and hypergraph packing
Böttcher, J.
(2023).
Graph and hypergraph packing.
In
Beliaev, D. & Smirnov, S.
(Eds.),
International Congress of Mathematicians, 2022 July 6–14
(pp. 4542 - 4566).
EMS Press.
https://doi.org/10.4171/icm2022/136
(2023).
Graph and hypergraph packing.
In
Beliaev, D. & Smirnov, S.
(Eds.),
International Congress of Mathematicians, 2022 July 6–14
(pp. 4542 - 4566).
EMS Press.
https://doi.org/10.4171/icm2022/136
Packing problems in combinatorics concern the edge disjoint embedding of a family of guest (hyper)graphs into a given host (hyper)graph. Questions of this type are intimately connected to the field of design theory, and have a variety of significant applications. The area has seen important progress in the last two decades, with a number of powerful new methods developed. Here, I will survey some major results contributing to this progress, alongside background, and some ideas concerning the methods involved.
