{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:25Z","timestamp":1753893805267,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let the edges of a graph $G$ be coloured so that no colour is  used more than $k$ times. We refer to this as a $k$-bounded colouring. We say that a subset of the edges of $G$ is multicoloured if each edge is of a different colour. We say that the colouring is  $\\cal H$-good, if a multicoloured  Hamilton cycle exists i.e.,  one with a multicoloured edge-set.  Let ${\\cal AR}_k$ = $\\{G :$ every $k$-bounded colouring of $G$ is $\\cal H$-good$\\}$. We establish the threshold  for the random graph $G_{n,m}$ to be in ${\\cal AR}_k$. <\/jats:p>","DOI":"10.37236\/1213","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T20:25:41Z","timestamp":1578687941000},"source":"Crossref","is-referenced-by-count":4,"title":["Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold"],"prefix":"10.37236","volume":"2","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[1995,10,1]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v2i1r19\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v2i1r19\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T01:23:46Z","timestamp":1579310626000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v2i1r19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1995,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1213","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[1995,10,1]]},"article-number":"R19"}}