Journal title
Journal of Combinatorial Theory, Series B
DOI
10.1016/j.jctb.2021.09.007
Volume
152
Last updated
2024-04-09T20:11:56.927+01:00
Page
281-318
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.
Symplectic ID
1101312
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article
Publication date
21 Oct 2021