L Gishboliner, M Krivelevich, P Michaeli - arXiv e-prints, 2020 - ui.adsabs.harvard.edu
We prove that a random graph $ G (n, p) $, with $ p $ above the Hamiltonicity threshold, is
typically such that for any $ r $-colouring of its edges there exists a Hamilton cycle with at …