Let f : [n] ? [n] be a function and let Tf be a labeled tree on n vertices, constructed from f using the procedure demonstrated in class. Suppose that f takes exactly k different values. Show that Tf has at most n?k vertices with degree at least four.
Hint: First, determine the maximum number of leaves in Tf .
Thanks
Get Answers For Free
Most questions answered within 1 hours.