Let f : [n] → [n] be a function, and let Tf be a labelled tree on n vertices, constructed from f. Suppose that T contains a vertex of degree at least k. Show that f takes at most n-k+2 different values.
I don't really know how to start here.
Thanks.
Let f : [n] → [n] be a function, and let Tf be a labelled tree on n vertices, constructed from f. Suppose that T contains a vertex of degree at least k. Show that f takes at most n-k+2 different values.
I don't really know how to start here.
Thanks.
Copyright © 2021 JogjaFile Inc.