Description
-
Show that for any ≥ 3, any tree with a vertex of degree must have at least leaves. The proof that uses summations of the result that a tree always has two leaves is probably easiest to adapt here. You will want to
assume ≥ 1 in the summations
∞ ∞
= ∑ ; total degree = ∑ .
