HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Book sections

Asymptotics for Connected Graphs and Irreducible Tournaments

Thierry Monteil 1 Khaydar Nurligareev
1 LIPN - Laboratoire d'Informatique de Paris-Nord
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 : connected graph irreducible tournament probability asymptotic expansion generating function
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

Collections

CNRS | INSMI | TDS-MACS | SORBONNE-PARIS-NORD | LIPN | UNIV-PARIS13

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

13