English

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 TT, let p1(k)(T)p^{(k)}_1(T) be the proportion of paths among all kk-vertex subtrees (induced connected subgraphs) of TT, and let p2(k)(T)p^{(k)}_2(T) be the proportion of stars. Our main theorem states: if p1(k)(Tn)0p^{(k)}_1(T_n) \to 0 for a sequence of trees T1,T2,T_1,T_2,\ldots whose size tends to infinity, then p2(k)(Tn)1p^{(k)}_2(T_n) \to 1. Both are also shown to be equivalent to the statement that the number of kk-vertex subtrees grows superlinearly and the statement that the (k1)(k-1)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}
}