Packing and counting arbitrary Hamilton cycles in random digraphs
Work
Year: 2018
Type: article
Abstract: We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in ( n, p ) for nearly optimal p (up to a factor). In particular, we show that given t = (1 − o (1)) np Hamilton cycles ... more
Source: Random Structures and Algorithms
Authors Asaf Ferber, Eoin Long
Institutions IIT@MIT, University of Oxford
Cites: 21
Cited by: 8
Related to: 10
FWCI: 1.258
Citation percentile (by year/subfield): 79.76
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze