Asymptotics for connected graphs and irreducible tournaments
arXiv:2205.06487 · doi:10.1007/978-3-030-83823-2_131
Abstract
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.
6 pages, 1 figure. Accepted to EuroComb 2021