Compatible Hamilton cycles in random graphs

DOI10.1002/rsa.20636zbMath1349.05199OpenAlexW2593916968MaRDI QIDQ2830238

Michael Krivelevich, Choongbum Lee, Benjamin Sudakov

Publication date: 9 November 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20636

zbMATH Keywords

random graphsHamilton cyclesrainbow cyclesincomparability systems

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Graph Tilings in Incompatibility Systems ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Compatible Hamilton cycles in Dirac graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Hamiltonian cycles in Dirac graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• The cardinal module and some theorems on families of sets
• Graphs with cycles having adjacent lines different colors
• Hamiltonian circuits in random graphs
• Alternating Hamiltonian cycles
• A property of the colored complete graph
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Multicoloured Hamilton cycles
• Random directed graphs are robustly Hamiltonian
• Local resilience of graphs
• Robust Hamiltonicity of Dirac graphs

This page was built for publication: Compatible Hamilton cycles in random graphs