Resilience with respect to Hamiltonicity in random graphs

MaRDI QIDQ6621180zbMATH OpenFDO

Authors Padraig Condon, Alberto Espuny Díaz, António Girão, Jaehoon Kim, Daniela Kühn, Deryk Osthus

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Dirac's theorem for random regular graphs
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs
• Dirac's theorem for random graphs
• Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs

Cites work

• scientific article; zbMATH DE number 3878974 (Why is no real title available?)
• scientific article; zbMATH DE number 3922707 (Why is no real title available?)
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• Dirac's theorem for random graphs
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• Local resilience of graphs
• On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs
• On two Hamilton cycle problems in random graphs
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Random regular graphs of high degree

Cited in

(2)

• The global resilience of Hamiltonicity in \(G(n, p)\)
• Resilience for tight Hamiltonicity

This page was built for publication: Resilience with respect to Hamiltonicity in random graphs

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