Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold

zbMath0827.05055MaRDI QIDQ1899825

Colin Cooper, Alan M. Frieze

Publication date: 19 October 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/118740

zbMATH Keywords

colouringrandom graphthresholdcolouranti-Ramsey thresholdmulticoloured Hamilton cycle

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Rainbow hamilton cycles in random graphs ⋮ Power of \(k\) choices and rainbow spanning trees in random graphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Pattern Colored Hamilton Cycles in Random Graphs

This page was built for publication: Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold