Graph and hypergraph packing

Böttcher, Julia ORCID: 0000-0002-4104-3635 (2023) Graph and hypergraph packing. In: Beliaev, Dmitry and Smirnov, Stanislav, (eds.) International Congress of Mathematicians, 2022 July 6–14. International Congress of Mathematicians,VI. EMS Press, Berlin, DE, 4542 - 4566. ISBN 9783985470648

Text (978-3-98547-564-3-volume-6-chapter-5567) - Published Version Available under License Creative Commons Attribution. Download (641kB)

Abstract

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.

Item Type:	Book Section
Additional Information:	© 2023 International Mathematical Union
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	20 Jan 2025 12:33
Last Modified:	20 Jan 2025 12:33
URI:	http://eprints.lse.ac.uk/id/eprint/126935

Actions (login required)

View Item