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

2022/12/22 by Lacaze-Masmonteil, Alice
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2212.12072

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, admits a resolvable decomposition into directed cycles of odd length m. This completely settles the directed Oberwolfach problem with tables of uniform length.

Related

• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• 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 Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles
• On the Directed Oberwolfach Problem with variable cycle lengths