We show that if − , the complete graph on vertices with a 1-factor removed, can be decomposed into cycles of a fixed odd length for all in the range ≤ < 3 that satisfy the obvious necessary conditions, then − can be decomposed into -cycles for all ≥ satisfying the necessary conditions