For, consider all trees where each vertex has degree
or less, and where the longest path is of length k or less. Show that the maximum number
of leaves among such trees satisfies the following:
Printable View
For