The connectivity-profile of random increasing k-trees

Alexis Darrasse (1) , Hsien-Kuei Hwang (2) , Olivier Bodini (1) , Michèle Soria (1)

1 APR - Algorithmes, Programmes et Résolution
2 STAT Sinica - Institute of Statistical Science

Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. We study in this paper a notion called connectivity-profile and derive asymptotic estimates for it; some interesting consequences will also be given.

Domaines: Combinatoire [math.CO]

Alexis Darrasse, Hsien-Kuei Hwang, Olivier Bodini, Michèle Soria. The connectivity-profile of random increasing k-trees. Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Jan 2010, Austin, United States. pp.99-106, ⟨10.1137/1.9781611973006.13⟩. ⟨hal-00424863⟩