Colorful Hamilton cycles in random graphs

Debsoumya Chakraborti, Alan Frieze, Mihir Hasabnis

Given an $n$ vertex graph whose edges have colored from one of $r$ colors $C=\{c_1,c_2,\dots ,c_r\}$, we define the Hamilton cycle color profile $hcp(G)$ to be the set of vectors $…