A Simple Proof of the Cayley Formula using Random Graphs
| Autor: | Wu, Scott, Li, Ray, He, Andrew, Hao, Steven |
|---|---|
| Rok vydání: | 2013 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled trees on $n$ vertices is $n^{n-2}.$ |
| Databáze: | arXiv |
| Externí odkaz: |
|