Rainbow Arborescence in Random Digraphs.

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 [ABSTRACT FROM AUTHOR]