The directed Oberwolfach problem with variable cycle lengths: a recursive construction

2023/09/22 by Kadri, Suzan, Šajna, Mateja
#05B30 #05C51 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2309.12549

Abstract

The directed Oberwolfach problem OP^∗(m₁,…,m_k) asks whether the complete symmetric digraph K_n^∗, assuming n=m₁+… +m_k, admits a decomposition into spanning subdigraphs, each a disjoint union of k directed cycles of lengths m₁,…,m_k. We hereby describe a method for constructing a solution to OP^∗(m₁,…,m_k) given a solution to OP^∗(m₁,…,m_ℓ), for some ℓ

Related

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