Any tree with at least two vertices must have at least two vertices of degree one.
Let's prove this proposition about trees by contradiction.
Tags: math, graphtheory, trees