Cyclic One-Factorization of the Complete Graph

It is shown that the complete graph K n has a cyclic 1-factorization if and only if n is even and n ≠2 t , t ⩾3.