pith. sign in

arxiv: 1706.06625 · v1 · pith:RFL6PDQAnew · submitted 2017-06-20 · 🧮 math.CO

On the directed Oberwolfach Problem with equal cycle lengths: the odd case

classification 🧮 math.CO
keywords directedadmitscyclesdecompositionlengthresolvablecasecomplete
0
0 comments X
read the original 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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.