Although, we credit Cayley, this theorem was first stated and proven by Borchardt (1860). > [!NOTE] Theorem > There are $n^{n-2}$ [[Trees (graph theory)|trees]] with vertex set $[n]=\{ 1,2,\dots,n \}$. ###### Double-counting proof (Pitnam)