Elegantly Colored Paths and Cycles in Edge Colored Random Graphs

DOI10.1137/15M1047106zbMath1391.05229arXiv1403.1453OpenAlexW2963272173MaRDI QIDQ3174699

Michael Krivelevich, Lisa Espig, Alan M. Frieze

Publication date: 18 July 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1453

zbMATH Keywords

random graphsrandomly edge coloredzebraic

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 (5)

Colorful Hamilton Cycles in Random Graphs ⋮ Color‐biased Hamilton cycles in random graphs ⋮ The threshold for the full perfect matching color profile in a random coloring of random graphs ⋮ On the number of alternating paths in random graphs ⋮ Pattern Colored Hamilton Cycles in Random Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polychromatic Hamilton cycles
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Hamilton cycles in a class of random directed graphs
• Multicoloured Hamilton cycles
• Rainbow connection of sparse random graphs
• The hitting time of rainbow connection number two
• Hamilton cycles containing randomly selected edges in random regular graphs
• Rainbow matchings and Hamilton cycles in random graphs
• Rainbow Hamilton cycles in random graphs and hypergraphs
• Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
• Rainbow Connection of Random Regular Graphs
• Rainbow hamilton cycles in random graphs
• On the existence of a factor of degree one of a connected random graph

This page was built for publication: Elegantly Colored Paths and Cycles in Edge Colored Random Graphs