Counting Hamilton cycles in sparse random directed graphs

DOI10.1002/rsa.20815zbMath1415.05078arXiv1708.07746OpenAlexW2963782526WikidataQ105583257 ScholiaQ105583257MaRDI QIDQ4625019

Asaf Ferber, Matthew Kwan, Benjamin Sudakov

Publication date: 20 February 2019

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

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

zbMATH Keywords

directed graphrandom graphHamilton cycle

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Related Items

Packing Arborescences in Random Digraphs