Completing the spectrum of almost resolvable cycle systems with odd cycle length
classification
🧮 math.CO
keywords
cyclealmostresolvablesystemslengthcompletescompletingconstruct
read the original abstract
In this paper, we construct almost resolvable cycle systems of order $4k+1$ for odd $k\ge 11$. This completes the proof of the existence of almost resolvable cycle systems with odd cycle length.
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.