Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
2018
In this paper, we almost completely solve the existence of almost resolvable cycle systems 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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
45
References
11
Citations
NaN
KQI