28th Cumberland Conference on Combinatorics, Graph Theory & Computing
Hua Wang
Georgia Southern University https://f56c669658843cbc6cddb57d4b91685ec9a54f79.googledrive.com/host/0B1q48QfFUyFsTUVINDctZ0dJSXM/ 

Abstract 
A small branch goes a long way: subtrees and distances...a slice of Székely's work and what it inspires
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. 