Graph and hypergraph packing

  • Julia Böttcher

    Department of Mathematics, London School of Economics and Political Science, Houghton Street, London WC2A 2AE, UK
Graph and hypergraph packing cover
Download Chapter PDF

This book chapter is published open access.


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.