Resolution of the Oberwolfach problem (Q2039583)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7367668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Resolution of the Oberwolfach problem |
scientific article; zbMATH DE number 7367668 |
Statements
Resolution of the Oberwolfach problem (English)
0 references
5 July 2021
0 references
Summary: The Oberwolfach problem, posed by G. 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\).
0 references
decompositions
0 references
resolvable designs
0 references
2-factors
0 references
cycles
0 references
0 references
0 references
0 references
0 references
0.8753050565719604
0 references
0.8585855960845947
0 references
0.8529486656188965
0 references
0.8501845002174377
0 references
0.8476176261901855
0 references
