How do I find the number $e(n)$ of trees with $n+1$unlabeled vertices $n$ labeled edges.
We're suppose to give a simple bijective proof, I guess?
Help appreciated!
How do I find the number $e(n)$ of trees with $n+1$unlabeled vertices $n$ labeled edges.
We're suppose to give a simple bijective proof, I guess?
Help appreciated!
Copyright © 2021 JogjaFile Inc.
Hint: Given an edge labeled tree $T$ with $n$ edges, choose a vertex of $T$ in $n+1$ ways and label it $0$. Then "push" each edge label to the vertex of that edge farthest from $0$.