On the directed Oberwolfach Problem with equal cycle lengths: the odd case
Abstract
We show that the complete symmetric digraph K2m admits a resolvable decomposition into directed cycles of length m for all odd m, 5 m 49. Consequently, Kn admits a resolvable decomposition into directed cycles of length m for all n 0 2m and odd m, 5 m 49.
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.