Presentation
A Small Branch Goes a Long Way: Subtrees and Distances
Cumberland Conference on Combinatorics, Graph Theory, and Computing
(2015)
Abstract
In this talk we survey some work on the number of subtrees and total distances in trees, most of which was inspired by earlier work of Székely. We will explore extremal problems, inverse problems, correlation between these two fundamental concepts as well as related work in bioinformatics, number theory, and discrete optimization.
We would like to dedicate this talk to Laszlo Székely, without whom most (if not all) of the work described in this talk would not exist.
Keywords
- Subrees,
- Total distances in trees,
- Laszlo Székely,
- Bioinformatics,
- Number thoery,
- Discrete optimization
Disciplines
Publication Date
May 15, 2015
Location
Columbia, SC
Citation Information
Hua Wang. "A Small Branch Goes a Long Way: Subtrees and Distances" Cumberland Conference on Combinatorics, Graph Theory, and Computing (2015) Available at: http://works.bepress.com/hua_wang/102/