  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.
