2020/09/18 by Elaheh Shabani, Shabani, Elaheh, Mateja Šajna +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Mathematics and Applications #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.2009.08731
31 pages, 7 figures
arxiv created 2020/09/18 · openalex publication_date 2020/09/18 · arxiv updated 2020/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Directed Oberwolfach Problem can be considered as the directed version of the well-known Oberwolfach Problem, first mentioned by Ringel at a conference in Oberwolfach, Germany in 1967. In this paper, we describe some new partial results on the Directed Oberwolfach Problem with variable cycle lengths. In particular, we show that the complete symmetric digraph Kn* admits a ( C2, ..., C2, C3) -factorization for all n≡ 1, 3, or 7\pmod8. We also show that Kn* admits a (C2, Cn-2)-factorization for any integer n ≥ 5.