We give a short proof of the fact that the number of labelled trees on $n$ vertices is $n^{n-2}$. Although many short proofs are known, we have not seen this one before.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。
