Color‐biased Hamilton cycles in random graphs

DOI10.1002/rsa.21043zbMath1522.05262arXiv2007.12111OpenAlexW3195662428MaRDI QIDQ6074685

Peleg Michaeli, Michael Krivelevich, Lior Gishboliner

Publication date: 12 October 2023

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

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

zbMATH Keywords

random graphsdiscrepancyHamilton cycles

Mathematics Subject Classification ID

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

Related Items (2)

Oriented discrepancy of Hamilton cycles ⋮ The multicolor size-Ramsey numbers of cycles

Cites Work

• The size Ramsey number of a directed path
• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• The Ramsey number for a triple of long even cycles
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Hamiltonian circuits in random graphs
• On the discrepancies of graphs
• Random graph's Hamiltonicity is strongly tied to its minimum degree
• Hamiltonicity in random graphs is born resilient
• Corrigendum. Three-color Ramsey numbers for paths
• Three-color Ramsey numbers for paths
• Introduction to Random Graphs
• Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
• Pattern Colored Hamilton Cycles in Random Graphs
• Sharp threshold for the appearance of certain spanning trees in random graphs
• Dirac's theorem for random graphs
• Elegantly Colored Paths and Cycles in Edge Colored Random Graphs
• The Evolution of Random Graphs
• The Ramsey number for stripes
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Combinatorial theorems relative to a random set
• A discrepancy version of the Hajnal–Szemerédi theorem
• Resilience of perfect matchings and Hamiltonicity in random graph processes
• Robustness of graph properties
• Long paths and Hamiltonicity in random graphs
• On the Number of Hamilton Cycles in Sparse Random Graphs
• On some Multicolor Ramsey Properties of Random Graphs
• Path Ramsey Number for Random Graphs
• Imbalances in k‐colorations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Color‐biased Hamilton cycles in random graphs