Balance in Random Trees
classification
🧮 math.CO
keywords
randombalancedlabeledprovetreesunlabeledbalancestrongly
read the original abstract
We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly $k$-balanced for any $k\geq 3$.
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.