  We compute the whole asymptotic expansion of the probability that a large
uniform labeled graph is connected, and of the probability that a large uniform
labeled tournament is irreducible. In both cases, we provide a combinatorial
interpretation of the involved coefficients.
