Asymptotics for connected graphs and irreducible tournaments
Combinatorics
2022-05-16 v1 Discrete Mathematics
Probability
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.
Keywords
Cite
@article{arxiv.2205.06487,
title = {Asymptotics for connected graphs and irreducible tournaments},
author = {Thierry Monteil and Khaydar Nurligareev},
journal= {arXiv preprint arXiv:2205.06487},
year = {2022}
}
Comments
6 pages, 1 figure. Accepted to EuroComb 2021