For p ≥ log^15 n / n, the random digraph D_{n,p} almost surely contains exactly δ±(D_{n,p}) edge-disjoint Hamilton cycles.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Minimum degree edge-disjoint Hamilton cycles in random directed graphs
For p ≥ log^15 n / n, the random digraph D_{n,p} almost surely contains exactly δ±(D_{n,p}) edge-disjoint Hamilton cycles.