Paths vs. stars in the local profile of trees
Combinatorics
2016-02-16 v2
Abstract
The aim of this paper is to provide an affirmative answer to a recent question by Bubeck and Linial on the local profile of trees. For a tree , let be the proportion of paths among all -vertex subtrees (induced connected subgraphs) of , and let be the proportion of stars. Our main theorem states: if for a sequence of trees whose size tends to infinity, then . Both are also shown to be equivalent to the statement that the number of -vertex subtrees grows superlinearly and the statement that the th degree moment grows superlinearly.
Keywords
Cite
@article{arxiv.1512.06526,
title = {Paths vs. stars in the local profile of trees},
author = {Éva Czabarka and László A. Székely and Stephan Wagner},
journal= {arXiv preprint arXiv:1512.06526},
year = {2016}
}