Sub-trees of a random tree

DOI10.1016/j.dam.2019.05.003zbMath1419.05047arXiv1808.04948OpenAlexW2964216318MaRDI QIDQ2274085

Paweł Prałat, Bogumił Kamiński

Publication date: 19 September 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.04948

zbMATH Keywords

Galton-Watson treerandom Cayley tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (1)

On subtree number index of generalized book graphs, fan graphs, and wheel graphs

Uses Software

• Julia

Cites Work

• Unnamed Item
• Binary trees with the largest number of subtrees
• Non-fringe subtrees in conditioned Galton-Watson trees
• On subtrees of trees
• Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
• Probability on Trees and Networks
• Julia: A Fresh Approach to Numerical Computing
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• The Number of Subtrees of Trees with Given Degree Sequence
• A derivation of the Borel distribution
• On the height of trees

This page was built for publication: Sub-trees of a random tree