On the directed Oberwolfach Problem with equal cycle lengths: the odd case

2017/06/20 by Andrea C. Burgess, Burgess, Andrea, Nevena Francetić +3 · 1 citation
Computer Science · Engineering · Mathematics · #05C51 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1706.06625

openalex publication_date 2017/06/20 · openalex created_date 2017/06/30 · openalex updated_date 2026/07/28

Abstract

We show that the complete symmetric digraph K_2m^∗ admits a resolvable decomposition into directed cycles of length m for all odd m, 5 ≤ m ≤ 49. Consequently, K_n^∗ admits a resolvable decomposition into directed cycles of length m for all n ≡ 0 \pmod2m and odd m, 5 ≤ m ≤ 49.

Cited by

• On the Directed Oberwolfach Problem with variable cycle lengths

Related

• Completing the solution of the directed Oberwolfach problem with cycles of equal length
• On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles
• The directed Oberwolfach problem with variable cycle lengths: a recursive construction
• On the Directed Oberwolfach Problem with variable cycle lengths
• Completing the solution of the directed Oberwolfach problem with two tables