A constructive solution to the Oberwolfach problem with a large cycle

DOI10.1016/J.DISC.2024.113947MaRDI QIDQ6204356zbMATH OpenOpenAlexFDO

Authors Tommaso Traetta

Publication date 27 March 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2306.12713

zbMATH Keywords

amalgamation-detachment techniqueOberwolfach problempyramidal automorphism group

Mathematics Subject Classification ID

Triple systems (05B07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: For every $2$-regular graph $F$ of order $v$, the Oberwolfach problem $OP(F)$ asks whether there is a $2$-factorization of $K_v$ ($v$ odd) or $K_v$ minus a $1$-factor ($v$ even) into copies of $F$. Posed by Ringel in 1967 and extensively studied ever since, this problem is still open. In this paper we construct solutions to $OP(F)$ whenever $F$ contains a cycle of length greater than an explicit lower bound. Our constructions combine the amalgamation-detachment technique with methods aimed at building $2$-factorizations with an automorphism group having a nearly-regular action on the vertex-set.

Recommendations

• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• On the Oberwolfach problem with two similar length cycles
• scientific article; zbMATH DE number 6452866
• Resolution of the Oberwolfach problem

Cites work

• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
• 3-pyramidal Steiner triple systems
• A complete solution to the two-table Oberwolfach problems
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Hamiltonian decompositions of complete graphs
• scientific article; zbMATH DE number 5917757 (Why is no real title available?)
• Merging combinatorial design and optimization: the Oberwolfach problem
• Note on three table Oberwolfach problem
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
• On a variation of the Oberwolfach problem
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
• On the honeymoon Oberwolfach problem
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings
• On the spouse-loving variant of the Oberwolfach problem
• Resolution of the Oberwolfach problem
• Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• The CRC handbook of combinatorial designs
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
• The Oberwolfach problem and factors of uniform odd length cycles
• The structure of 2-pyramidal 2-factorizations

Cited in

(5)

• A complete solution to the infinite Oberwolfach problem
• Resolution of the Oberwolfach problem
• Completing the solution of the directed Oberwolfach problem with two tables
• The directed uniform Hamilton-Waterloo problem involving even cycle sizes
• Transforming solutions for the Oberwolfach problem into solutions for the spouse-loving variant

This page was built for publication: A constructive solution to the Oberwolfach problem with a large cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204356)