The phase transition in the evolution of random digraphs

Let (n, M) denote a digraph chosen at random from the family of all digraphs on n vertices with M arcs. We shall prove that if M/n ≤ c 1 the largest component of (n, M) is of the order n with probability 1 - o(1).