A remark on Hamilton cycles with few colors

Igor Balla, Alexey Pokrovskiy, Benny Sudakov

Research output: Contribution to journalArticlepeer-review


Akbari, Etesami, Mahini, and Mahmoody conjectured that every proper edge-coloring of Kn with n colors contains a Hamilton cycle with ≤ O(log n) colors. They proved that there is always a Hamilton cycle with ≤ 8pn colors. In this note we improve this bound to O(log3 n).

Original languageEnglish
Pages (from-to)73-77
Number of pages5
JournalMoscow Journal of Combinatorics and Number Theory
Issue number3
StatePublished - 2017
Externally publishedYes


  • Hamilton cycle
  • probabilistic methods
  • spectral techniques


Dive into the research topics of 'A remark on Hamilton cycles with few colors'. Together they form a unique fingerprint.

Cite this