Resolution of the Oberwolfach problem
OPEN ACCESS
Author / Producer
Date
2021
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
The Oberwolfach problem, posed by Ringel in 1967. asks for a decomposition of K-2n(+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.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
23 (8)
Pages / Article No.
2511 - 2547
Publisher
European Mathematical Society
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Decomposition; resolvable designs; 2-factors; cycles
Organisational unit
02889 - ETH Institut für Theoretische Studien / ETH Institute for Theoretical Studies