Random directed graphs are robustly Hamiltonian
Work
Year: 2015
Type: article
Abstract: A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on n vertices with minimum out-degree and in-degree at least contains a directed Hamilton cycle. In this paper we exten... more
Source: Random Structures and Algorithms
Authors Dan Hefetz, Angelika Steger, Benny Sudakov
Institutions University of Birmingham, ETH Zurich
Cites: 41
Cited by: 14
Related to: 10
FWCI: 2.726
Citation percentile (by year/subfield): 78.49
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green