Extremal aspects of graph and hypergraph decomposition problems
Combinatorics
2021-06-28 v3
Abstract
We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.
Cite
@article{arxiv.2008.00926,
title = {Extremal aspects of graph and hypergraph decomposition problems},
author = {Stefan Glock and Daniela Kühn and Deryk Osthus},
journal= {arXiv preprint arXiv:2008.00926},
year = {2021}
}
Comments
final version as appearing in Surveys in Combinatorics 2021