We address the last outstanding case of the directed Oberwolfach problem with two tables of different lengths. Specifically, we show that the complete symmetric directed graph K^*ₙ admits a decomposition into spanning subdigraphs comprised of two vertex-disjoint directed cycles of length t₁ and t₂, respectively, where t₁∈ \4,6\, t₂ is even, and t₁+t₂ 14. In conjunction with recent results of Kadri and {S}ajna, this gives a complete solution to the directed Oberwolfach problem with two tables of different lengths.
No takes yet. Share an insight, caveat, or question.
Horsley et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: