Resolution of the Oberwolfach problem

Stefan Glock, Felix Joos, Jaehoon Kim, Daniela Kuhn, Deryk Osthus

Research output: Contribution to journalArticlepeer-review

114 Downloads (Pure)


The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of K2n+1 into edge-disjoint copies of a given 2-factor. We show that this can be achieved for all large n. 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 n.
Original languageEnglish
Pages (from-to)1-29
JournalJournal of the European Mathematical Society
Issue number00
Early online date30 Mar 2021
Publication statusE-pub ahead of print - 30 Mar 2021


  • 2-factors
  • Cycles
  • Decompositions
  • Resolvable designs

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics


Dive into the research topics of 'Resolution of the Oberwolfach problem'. Together they form a unique fingerprint.

Cite this