Learn More
In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge coloring of the complete graph K n , there is a Hamil-ton cycle with at most √ 8n different colors. We also prove that in every proper edge coloring of the complete graph K n , there is a rainbow cycle with at least n/2−1 colors (A rainbow cycle is a cycle whose(More)
  • 1