On the Directed Oberwolfach Problem with variable cycle lengths
Abstract
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 78. We also show that Kn* admits a (C2, Cn-2)-factorization for any integer n ≥ 5.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.