Open Access UCL Research: Rainbow Cliques in Randomly Perturbed Dense Graphs https://t.co/5jg4TZ37Fu
Extended Abstracts EuroComb 2021
Springer International Publishing
Open Access UCL Research: Rainbow Cliques in Randomly Perturbed Dense Graphs https://t.co/5jg4TZ37Fu
RT @mathCObot: Thierry Monteil, Khaydar Nurligareev: Asymptotics for connected graphs and irreducible tournaments https://t.co/63VlKWvgCe h…
interpretation of the involved coefficients. [2/2 of https://t.co/dPoJOre3qE]
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 [1/2 of https://t.co/dPoJ