论文标题
连接图和不可还原锦标赛的渐近学
Asymptotics for connected graphs and irreducible tournaments
论文作者
论文摘要
我们计算了连接大型均匀标记图的概率的整个渐近扩展，以及大型统一标记的比赛的可能性是不可还原的。在这两种情况下，我们都提供了对所涉及系数的组合解释。
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.
