Robust hamiltonicity of random directed graphs extended abstract

DOI10.1137/1.9781611973730.117zbMath1371.05264OpenAlexW4248133988MaRDI QIDQ5363063

Asaf Ferber, Ueli Peter, Rajko Nenadov, 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

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

Related Items (3)

Packing arborescences in random digraphs ⋮ Packing and counting arbitrary Hamilton cycles in random digraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

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