Paths vs. stars in the local profile of trees
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 T, let p(k)1(T) be the proportion of paths among all k-vertex subtrees (induced connected subgraphs) of T, and let p(k)2(T) be the proportion of stars. Our main theorem states: if p(k)1(Tn) 0 for a sequence of trees T1,T2,… whose size tends to infinity, then p(k)2(Tn) 1. Both are also shown to be equivalent to the statement that the number of k-vertex subtrees grows superlinearly and the statement that the (k-1)th degree moment grows superlinearly.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.