The minimum multicut problem on a cycle is to find a multicut on an undirected cycle such that the sum of weights is minimized, which is known to be polynomially solvable. This paper shows that there exists a compact polyhedral description of the set of feasible solutions to the problem whose number of variables and constraints is O($upsilonkappa$).