We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Rainbow Arborescence in Random Digraphs.
- Authors
Bal, Deepak; Bennett, Patrick; Cooper, Colin; Frieze, Alan; Prałat, Paweł
- Abstract
We consider the Erdős-Rényi random directed graph process, which is a stochastic process that starts with n vertices and no edges, and at each step adds one new directed edge chosen uniformly at random from the set of missing edges. Let
- Subjects
POISSON summation formula; PLANAR graphs; SPHERES; GEOMETRIC vertices; STOCHASTIC approximation
- Publication
Journal of Graph Theory, 2016, Vol 83, Issue 3, p251
- ISSN
0364-9024
- Publication type
Article
- DOI
10.1002/jgt.21995