Resolution of the Oberwolfach problem
From MaRDI portal
Publication:2039583
Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40) Paths and cycles (05C38) Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Abstract: The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of into edge-disjoint copies of a given -factor. We show that this can be achieved for all large . 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 .
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\).
Recommendations
Cites work
- A bandwidth theorem for approximate decompositions
- A blow-up lemma for approximate decompositions
- A complete solution to the two-table Oberwolfach problems
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Asymptotic behavior of the chromatic index for hypergraphs
- Blow-up lemma
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Counting designs
- Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
- Edge-decompositions of graphs with high minimum degree
- Fractional clique decompositions of dense partite graphs
- Fractional triangle decompositions in graphs with large minimum degree
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- scientific article; zbMATH DE number 5917757 (Why is no real title available?)
- scientific article; zbMATH DE number 3904599 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 874528 (Why is no real title available?)
- scientific article; zbMATH DE number 3349817 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- Merging combinatorial design and optimization: the Oberwolfach problem
- On a hypergraph matching problem
- On a variation of the Oberwolfach problem
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- On the decomposition threshold of a given graph
- On the Hamilton-Waterloo problem
- Optimal packings of bounded degree trees
- Packing degenerate graphs
- Packing spanning graphs from separable families
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- The early history of block designs
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- The Oberwolfach problem and factors of uniform odd length cycles
- The solution of the bipartite analogue of the Oberwolfach problem
Cited in
(31)- Gersten resolution with support
- On zero-sum spanning trees and zero-sum connectivity
- Decomposing hypergraphs into cycle factors
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- The generalised Oberwolfach problem
- A greedy algorithm for the social golfer and the Oberwolfach problem
- A Short proof of the blow-up lemma for approximate decompositions
- The wonderful Walecki construction
- A generalization of the Oberwolfach problem
- Merging combinatorial design and optimization: the Oberwolfach problem
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- On the generalized Oberwolfach problem
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
- Graph and hypergraph colouring via nibble methods: a survey
- A complete solution to the infinite Oberwolfach problem
- Graph and hypergraph packing
- A constructive solution to the Oberwolfach problem with a large cycle
- Solutions to the Oberwolfach problem for orders up to 100
- Regular decomposition of the edge set of a graph with applications
- The Oberwolfach problem with loving couples
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- A survey on constructive methods for the Oberwolfach problem and its variants
- Resolution of the Oberwolfach problem
- Completing the solution of the directed Oberwolfach problem with two tables
- A solution to small cases of the honeymoon Oberwolfach problem
- The directed Oberwolfach problem with variable cycle lengths: a recursive construction
- The directed uniform Hamilton-Waterloo problem involving even cycle sizes
- Ascending subgraph decomposition
- Transforming solutions for the Oberwolfach problem into solutions for the spouse-loving variant
- The maximum diameter of 2-dimensional simplicial complexes
This page was built for publication: Resolution of the Oberwolfach problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039583)
