Further results on the Hamilton-Waterloo problem
classification
🧮 math.CO
keywords
almostcyclehamilton-waterlooproblemresolvablecombinatorialcompletelyexistence
read the original abstract
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the Hamilton-Waterloo problem.
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.