  We consider random directed graphs, and calculate the distribution of the
cokernels of their laplacian, following the methods used by Wood. As a
corollary, we show that the probability that a random digraph is coeulerian is
asymptotically upper bounded by a constant around $0.43$.

Combinatorics