Vertices of degree k in random unlabeled trees
From MaRDI portal
Publication:3113282
Recommendations
Cites work
- An asymptotic evaluation of the cycle index of a symmetric group
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Nodes of large degree in random trees and forests
- The distribution of degrees in a large random tree
- The distribution of nodes of given degree in random trees
- The number of trees
- Unlabeled trees: Distribution of the maximum degree
Cited in
(10)- An asymptotic analysis of unlabeled \(k\)-trees
- scientific article; zbMATH DE number 3952789 (Why is no real title available?)
- The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
- scientific article; zbMATH DE number 6297799 (Why is no real title available?)
- Counting embeddings of rooted trees into families of rooted trees
- Vertices with fixed outdegrees in large Galton-Watson trees
- Vertices of degree \(k\) in random unlabeled trees
- An asymptotic analysis of labeled and unlabeled \(k\)-trees
- Graph limits of random unlabelled k-trees
- Asymptotic enumeration and limit laws for multisets: the subexponential case
This page was built for publication: Vertices of degree \(k\) in random unlabeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113282)