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.
Original language | American English |
---|---|
State | Published - May 15 2015 |
Event | Cumberland Conference on Combinatorics, Graph Theory, and Computing - Columbia, SC Duration: May 15 2015 → … |
Conference
Conference | Cumberland Conference on Combinatorics, Graph Theory, and Computing |
---|---|
Period | 05/15/15 → … |
Disciplines
- Mathematics
Keywords
- Bioinformatics
- Discrete optimization
- Laszlo Székely
- Number thoery
- Subrees
- Total distances in trees