|
We give an alternative proof of Cayley's theorem on the number of labelled trees. Essentially, we use the Prüfer code, but the method seems to be novel.
Bibtex entry:
| AUTHOR | = | {Fleiner, Tam{\'a}s}, |
| TITLE | = | {On Pr{\"u}fer codes}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2005}, |
| NUMBER | = | {TR-2005-16} |