A short proof of Cayley's tree formula

TL;DR

This paper presents a concise proof of Cayley's tree formula, deriving a recursive relation for labeled trees and confirming the formula that counts the number of labeled trees on n vertices.

Contribution

It introduces a new recursive relation for counting labeled trees and provides an alternative proof of Cayley's formula using this relation.

Findings

Derived a nonlinear recursive relation for labeled trees.

Proved that the number of labeled trees is n^{n-2}.

Provided a shorter proof of Cayley's tree formula.

Abstract

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial argument, $$ T_n = \frac{n}{2} \sum_{k=0}^{n-2} \left ( \begin {array} {c} n-2 \\ k \end {array} \right ) T_{k+1} T_{n-k-1}; \ \ for \ n > 1 \ and \ T_1 = 1, $$ and then it is proved that $T_n = n^{n-2}$, which gives yet another proof of the celebrated Cayley's tree formula.