Polychromatic Hamilton cycles

Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no more than k times, k = [n/A 1n n], for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic."