Resolution of the Oberwolfach problem
Combinatorics
2021-02-12 v2
Abstract
The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of into edge-disjoint copies of a given -factor. We show that this can be achieved for all large . We actually prove a significantly more general result, which allows for decompositions into more general types of factors. In particular, this also resolves the Hamilton-Waterloo problem for large .
Cite
@article{arxiv.1806.04644,
title = {Resolution of the Oberwolfach problem},
author = {Stefan Glock and Felix Joos and Jaehoon Kim and Daniela Kühn and Deryk Osthus},
journal= {arXiv preprint arXiv:1806.04644},
year = {2021}
}
Comments
revised version, to appear in Journal of the European Mathematical Society