A Simple Proof of the Cayley Formula using Random Graphs
classification
🧮 math.CO
keywords
cayleyformulaproofapplicationscycleextensionsfamousgenerated
read the original abstract
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}.$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.