3^n-vertex cliques are partitionable into 3 long cycles
Source: Kürschák 2002, problem 3
July 8, 2014
combinatoricspartitionTrianglesgraph theory
Problem Statement
Prove that the edges of a complete graph with vertices can be partitioned into disjoint cycles of length .