Resolution of the Oberwolfach problem

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

doi:10.4171/JEMS/1060

Resolution of the Oberwolfach problem

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

Mathematics

Research output: Contribution to journal › Article › peer-review

151 Downloads (Pure)

Abstract

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 language	English
Pages (from-to)	1-29
Journal	Journal of the European Mathematical Society
Volume	2021
Issue number	00
Early online date	30 Mar 2021
DOIs	https://doi.org/10.4171/JEMS/1060
Publication status	E-pub ahead of print - 30 Mar 2021

Keywords

2-factors
Cycles
Decompositions
Resolvable designs

ASJC Scopus subject areas

Mathematics(all)
Applied Mathematics

Access to Document

10.4171/JEMS/1060Licence: None: All rights reserved

GlockS2021Resolution
Glock, S. et al., 2021. Resolution of the Oberwolfach problem. Journal of the European Mathematical Society. Available at: http://dx.doi.org/10.4171/jems/1060. © 2021 EMS Publishing House. All rights reserved.
Accepted author manuscript, 478 KBLicence: None: All rights reserved

Cite this

@article{746a47ffa974403bab4c529bbdb12e32,

title = "Resolution of the Oberwolfach problem",

abstract = "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.",

keywords = "2-factors, Cycles, Decompositions, Resolvable designs",

author = "Stefan Glock and Felix Joos and Jaehoon Kim and Daniela Kuhn and Deryk Osthus",

year = "2021",

month = mar,

day = "30",

doi = "10.4171/JEMS/1060",

language = "English",

volume = "2021",

pages = "1--29",

journal = "Journal of the European Mathematical Society",

issn = "1435-9855",

publisher = "European Mathematical Society",

number = "00",

}

TY - JOUR

T1 - Resolution of the Oberwolfach problem

AU - Glock, Stefan

AU - Joos, Felix

AU - Kim, Jaehoon

AU - Kuhn, Daniela

AU - Osthus, Deryk

PY - 2021/3/30

Y1 - 2021/3/30

N2 - 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.

AB - 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.

KW - 2-factors

KW - Cycles

KW - Decompositions

KW - Resolvable designs

UR - http://www.scopus.com/inward/record.url?scp=85108441234&partnerID=8YFLogxK

U2 - 10.4171/JEMS/1060

DO - 10.4171/JEMS/1060

M3 - Article

SN - 1435-9855

VL - 2021

SP - 1

EP - 29

JO - Journal of the European Mathematical Society

JF - Journal of the European Mathematical Society

IS - 00

ER -

Resolution of the Oberwolfach problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this