We consider two varieties of labeled rooted trees, namely non-plane and plane 1-2 trees. In these tree varieties, we study the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree size goes to infinity.
@article{10_37236_7731,
author = {Mikl\'os B\'ona and Istv\'an Mez\H{o}},
title = {Limiting probabilities for vertices of a given rank in 1-2 trees},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {3},
doi = {10.37236/7731},
zbl = {1419.05043},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7731/}
}
TY - JOUR
AU - Miklós Bóna
AU - István Mező
TI - Limiting probabilities for vertices of a given rank in 1-2 trees
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/7731/
DO - 10.37236/7731
ID - 10_37236_7731
ER -
%0 Journal Article
%A Miklós Bóna
%A István Mező
%T Limiting probabilities for vertices of a given rank in 1-2 trees
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/7731/
%R 10.37236/7731
%F 10_37236_7731
Miklós Bóna; István Mező. Limiting probabilities for vertices of a given rank in 1-2 trees. The electronic journal of combinatorics, Tome 26 (2019) no. 3. doi: 10.37236/7731
