arXiv Analytics

Sign in

arXiv:1712.09507 [math.CO]AbstractReferencesReviewsResources

Protected Vertices in Motzkin trees

Anthony Van Duzer

Published 2017-12-27Version 1

In this paper we find recurrence relations for the asymptotic probability a vertex is $k$ protected in all Motzkin trees. We use a similar technique to calculate the probabilities for balanced vertices of rank $k$. From this we calculate upper and lower bounds for the probability a vertex is balanced and upper and lower bounds for the expected rank of balanced vertices.

Related articles: Most relevant | Search more
arXiv:1006.3783 [math.CO] (Published 2010-06-18)
Crossings, colorings, and cliques
arXiv:1007.3546 [math.CO] (Published 2010-07-21, updated 2010-07-24)
Lower bounds for designs in symmetric spaces
arXiv:math/0410218 [math.CO] (Published 2004-10-08)
The sum of degrees in cliques