Mathematical Sciences: Faculty Presentations (1991-2022)

The Average Order of a Subtree of a Tree

Document Type

Presentation

Presentation Date

10-24-2008

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Abstract or Description

Let T be a tree all of whose internal vertices have degree at least three. We show that the average order of a subtree of T is at least half the order of T, proving a conjecture raised by Jamison in 1983. It is also shown that the average order of a subtree of T is at most three quarters the order of T. Some open questions will be stated as well.

Sponsorship/Conference/Institution

Fall Southeastern Sectional Meeting of the American Mathematical Society (AMS)

Location

Huntsville, AL

Share

COinS