The connectivity-profile of random increasing k-trees
classification
🧮 math.CO
keywords
connectivity-profileincreasinginterestingk-treesrandomanalytic-combinatorialappliedasymptotic
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.