Robust Hamiltonicity of random directed graphs: extended abstract

DOI10.1137/1.9781611973730.117MaRDI QIDQ5363063zbMATH OpenOpenAlexFDO

Authors Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Škorić

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973730.117

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Robust Hamiltonicity of random directed graphs
• Random directed graphs are robustly Hamiltonian
• Hamiltonicity in random directed graphs is born resilient
• Dirac's theorem for random regular graphs
• Dirac's theorem for random graphs

Cited in

(8)

• Packing arborescences in random digraphs
• Hamiltonicity in random graphs is born resilient
• Robust Hamiltonicity of random directed graphs
• Random directed graphs are robustly Hamiltonian
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Hamiltonicity in random directed graphs is born resilient
• Packing and counting arbitrary Hamilton cycles in random digraphs
• Robust Hamiltonicity of Dirac graphs

This page was built for publication: Robust Hamiltonicity of random directed graphs: extended abstract

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