Article
The Average Order of a Subtree of a Tree
Journal of Combinatorial Theory, Series B
Document Type
Article
Publication Date
3-1-2010
DOI
10.1016/j.jctb.2009.05.006
Disciplines
- Education and
- Mathematics
Abstract
Let T be a tree all of whose internal vertices have degree at least three. In 1983 Jamison conjectured in JCT B that the average order of a subtree of T is at least half the order of T. In this paper a proof is provided. In addition, it is proved that the average order of a subtree of T is at most three quarters the order of T. Several open questions are stated.
Citation Information
Andrew Vince and Hua Wang. "The Average Order of a Subtree of a Tree" Journal of Combinatorial Theory, Series B Vol. 100 Iss. 2 (2010) p. 161 - 170 ISSN: 0095-8956 Available at: http://works.bepress.com/hua_wang/75/