Answers are grounded in this paper and cite their sources.
For all odd integers n and all non-negative integers r and s satisfying 3r + 5s = n(n − 1)/2 it is shown that the edge set of the complete graph on n vertices can be partitioned into r 3-cycles and s 5-cycles. For all even integers n and all non-negative integers r and s satisfying 3r + 5s = n(n − 2)/2 it is shown that the edge set of the complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s 5-cycles.
No takes yet. Share an insight, caveat, or question.
Adams et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: