Asymptotics for connected graphs and irreducible tournaments

05/13/2022
by   Thierry Monteil, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2021

On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a centrality measure based on the overall amou...
research
01/05/2018

Seymour's conjecture on 2-connected graphs of large pathwidth

We prove the conjecture of Seymour (1993) that for every apex-forest H_1...
research
09/02/2023

Characterising 4-tangles through a connectivity property

Every large k-connected graph-minor induces a k-tangle in its ambient gr...
research
09/16/2022

Error bounds for the asymptotic expansion of the partition function

Asymptotic study on the partition function p(n) began with the work of H...
research
07/15/2023

Computing SEQ-IC-LCS of Labeled Graphs

We consider labeled directed graphs where each vertex is labeled with a ...
research
07/20/2020

Biased measures for random Constraint Satisfaction Problems: larger interaction range and asymptotic expansion

We investigate the clustering transition undergone by an exemplary rando...
research
01/15/2019

An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs

We present an algorithm for bounding the probability of r-core formation...

Please sign up or login with your details

Forgot password? Click here to reset