A tree is a connected acyclic graph. It is a fundamental property of trees that a tree with \( n \) vertices always has \( n - 1 \) edges. This is because, in a tree, there are no cycles, and adding any extra edge would create a cycle.
Thus, the number of edges in a tree with \( n \) vertices is \( n - 1 \).