@article{doi:10.1002/rsa.20833, author = {Stufler, Benedikt}, title = {The continuum random tree is the scaling limit of unlabeled unrooted trees}, journal = {Random Structures \& Algorithms}, volume = {55}, number = {2}, pages = {496-528}, keywords = {continuum random tree, graph limits, random unlabelled trees}, doi = {10.1002/rsa.20833}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20833}, eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20833}, abstract = {We show that the uniform unlabeled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This confirms a conjecture by Aldous (1991). We also establish Benjamini-Schramm convergence of this model of random trees and provide a general approximation result, that allows for a transfer of a wide range of asymptotic properties of extremal and additive graph parameters from Pólya trees to unrooted trees.},, year = {2019} }