LMS Research School: Graph Packing28 Feb 2020, by Sponsored events in
19 April 2020 – 25 April 2020
The application of random processes, the regularity method, and the absorbing method are three powerful modern techniques in Extremal Combinatorics which featured in many significant advances in the field over the last 20 years. One topic that brings all these three approaches together is that of graph and hypergraph packing. Packing problems study conditions under which copies of different graphs can be embedded edge-disjointly into a given host graph. There are applications of this in such diverse areas as information theory, computational complexity, computational biology, experiment design, and the theory of combinatorial games. With the help of the above-mentioned techniques, celebrated breakthroughs were recently possible on a number of long-standing and difficult questions in this area.
The purpose of this Research School is to introduce young researchers to these problems, results, and techniques, and to explore open questions in the field and in related research areas.
Peter Allen, London School of Economics
Julia Böttcher, London School of Economics
Jozef Skokan, London School of Economics
For more information, please visit the website here.