arXiv · 1706.06625
On the directed Oberwolfach Problem with equal cycle lengths: the odd case
Abstract
We show that the complete symmetric digraph $K_{2m}^\ast$ admits a resolvable decomposition into directed cycles of length $m$ for all odd $m$, $5 \le m \le 49$. Consequently, $K_{n}^\ast$ admits a resolvable decomposition into directed cycles of length $m$ for all $n \equiv 0 \pmod{2m}$ and odd $m$, $5 \le m \le 49$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Andrea Burgess, Nevena Francetic, Mateja Sajna. 2017-06-20. On the directed Oberwolfach Problem with equal cycle lengths: the odd case. https://arxiv.org/abs/1706.06625
Cite the original work for its findings. Save a collection to share your selection of sources.