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.

翻译：我们计算了一个大型统一标签图表连接的概率,以及一个大型统一标签的锦标赛不可降低的概率。 在这两种情况下,我们对相关系数的组合解释都提供了一种组合解释。