KURSCHAK 2002 Problem 3
Prove that the edges of a complete graph with vertices can be partitioned into disjoint cycles of length .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.