Completing the solution of the directed Oberwolfach problem with cycles of equal length

DOI10.1002/JCD.21918MaRDI QIDQ6187009zbMATH OpenOpenAlexFDO

Authors

Publication date 5 February 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

complete symmetric digraphdirected Oberwolfach problemMendelsohn designresolvable directed cycle decomposition

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In this paper, we give a solution to the last outstanding case of the directed Oberwolfach problem with tables of uniform length. Namely, we address the two-table case with tables of odd length. We prove that the complete symmetric digraph on $2m$ vertices, denoted $K_{2m}^{\ast }$, admits a resolvable decomposition into directed cycles of odd length $m$. This completely settles the directed Oberwolfach problem with tables of uniform length.

Recommendations

• On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
• On the directed Oberwolfach problem with equal cycle lengths
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• Some cyclic solutions to the three table Oberwolfach problem
• On the minisymposium problem

Cites work

• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decomposition of lexicographic products of digraphs
• On a variation of the Oberwolfach problem
• On the directed Oberwolfach problem with equal cycle lengths
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• Resolvable decomposition of K^*_n
• Resolvable Mendelsohn designs with block size 4
• Resolvable perfect Mendelsohn designs with block size five
• Some observations on the oberwolfach problem
• The CRC handbook of combinatorial designs
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles

Cited in

(6)

• On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
• On the minisymposium problem
• Completing the solution of the directed Oberwolfach problem with two tables
• The directed Oberwolfach problem with variable cycle lengths: a recursive construction
• On the directed Hamilton-Waterloo problem with two cycle sizes
• The directed uniform Hamilton-Waterloo problem involving even cycle sizes

This page was built for publication: Completing the solution of the directed Oberwolfach problem with cycles of equal length

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