Skip to Main content Skip to Navigation
Book sections

Asymptotics for Connected Graphs and Irreducible Tournaments

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.
Document type :
Book sections
Complete list of metadata

https://hal-cnrs.archives-ouvertes.fr/hal-03438692
Contributor : Thierry Monteil Connect in order to contact the contributor
Submitted on : Sunday, November 21, 2021 - 10:17:27 PM
Last modification on : Monday, November 22, 2021 - 3:38:15 AM

Identifiers

Citation

Thierry Monteil, Khaydar Nurligareev. Asymptotics for Connected Graphs and Irreducible Tournaments. Extended Abstracts EuroComb 2021, 14, Springer International Publishing, pp.823-828, 2021, Trends in Mathematics, ⟨10.1007/978-3-030-83823-2_131⟩. ⟨hal-03438692⟩

Share

Metrics

Record views

17