A constructive solution to the Oberwolfach problem with a large cycle

DOI10.1016/j.disc.2024.113947arXiv2306.12713OpenAlexW4392431899MaRDI QIDQ6204356

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

Oberwolfach problemamalgamation-detachment techniquepyramidal automorphism group

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Note on three table Oberwolfach problem
• A complete solution to the two-table Oberwolfach problems
• Hamiltonian decompositions of complete graphs
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• On a variation of the Oberwolfach problem
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles
• Resolution of the Oberwolfach problem
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings
• The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
• The structure of 2-pyramidal 2-factorizations
• On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
• 3-pyramidal Steiner triple systems
• 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
• Merging Combinatorial Design and Optimization: the Oberwolfach Problem
• On the honeymoon Oberwolfach problem
• On the spouse‐loving variant of the Oberwolfach problem
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length

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