Betweenness center of a uniformly random tree

Prove or disprove that, for a uniformly random unlabeled tree T_n of order n, the probability that the betweenness center has order one converges to one as n tends to infinity.

Background

The paper’s enumeration of trees through order 20 shows that betweenness centers are typically small in the examined range, while the preceding discussion notes that trees with arbitrarily large centers nevertheless exist. This motivates a probabilistic conjecture concerning the asymptotic behavior of the betweenness center of a uniformly random unlabeled tree.

The conjecture specifically predicts that almost every sufficiently large unlabeled tree has a unique vertex of maximum betweenness.

References

Let $T_n$ be chosen uniformly at random from all unlabeled trees of order $n$. Then $ \Pr(|C_{\rm b}(T_n)|=1)\longrightarrow 1 \quad\text{as }n\to\infty. $

Betweenness centers of graphs  (2609.09342 - Madaras et al., 8 Sep 2026) in Section 4, Concluding remarks, Conjecture