The generalised Oberwolfach problem
Combinatorics
2020-04-22 v1
Abstract
We prove that any quasirandom dense large graph in which all degrees are equal and even can be decomposed into any given collection of two-factors (2-regular spanning subgraphs). A special case of this result gives a new solution to the Oberwolfach problem.
Keywords
Cite
@article{arxiv.2004.09937,
title = {The generalised Oberwolfach problem},
author = {Peter Keevash and Katherine Staden},
journal= {arXiv preprint arXiv:2004.09937},
year = {2020}
}
Comments
32 pages, 4 figures