Resolution of the Oberwolfach problem

2018/06/12 by Glock, Stefan, Joos, Felix, Kim, Jaehoon +2 · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1806.04644

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.

Cited by

• The maximum diameter of 2-dimensional simplicial complexes
• Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

Related

• A constructive solution to the Oberwolfach Problem with a large cycle
• The generalised Oberwolfach problem
• A survey on constructive methods for the Oberwolfach problem and its variants
• Merging Combinatorial Design and Optimization: the Oberwolfach Problem
• On the Hamilton-Waterloo Problem with a single factor of 6-cycles