Compatible Hamilton cycles in random graphs

DOI10.1002/RSA.20636MaRDI QIDQ2830238zbMATH OpenOpenAlexFDO

Authors Michael Krivelevich, Choongbum Lee, Benny 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

Hamilton cyclesincomparability systemsrainbow cyclesrandom graphs

Mathematics Subject Classification ID

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

Recommendations

• Color‐biased Hamilton cycles in random graphs
• Random graph's Hamiltonicity is strongly tied to its minimum degree
• Rainbow Hamilton cycles in random graphs
• On two Hamilton cycle problems in random graphs
• Colorful Hamilton Cycles in Random Graphs

Cites work

• A property of the colored complete graph
• Alternating Hamiltonian cycles
• Graphs with cycles having adjacent lines different colors
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Hamiltonian circuits in random graphs
• Hamiltonian cycles in Dirac graphs
• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 1286511 (Why is no real title available?)
• scientific article; zbMATH DE number 1067836 (Why is no real title available?)
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• scientific article; zbMATH DE number 3249675 (Why is no real title available?)
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Local resilience of graphs
• Multicoloured Hamilton cycles
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Random directed graphs are robustly Hamiltonian
• Robust Hamiltonicity of Dirac graphs
• The cardinal module and some theorems on families of sets

Cited in

(5)

• Properly colored Hamilton cycles in Dirac-type hypergraphs
• Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
• Graph Tilings in Incompatibility Systems
• Compatible powers of Hamilton cycles in dense graphs
• Compatible Hamilton cycles in Dirac graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830238)