REVIEW
An Elementary Proof of the Cayley Formula Using Random Maps
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
An Elementary Proof of the Cayley Formula Using Random Maps
classification
math.CO
keywords
formulacayleyelementelementaryproofrandombijectivecalculation
read the original abstract
Cayley's formula states that the number of labelled trees on $n$ vertices is $n^{n-2}$, and many of the current proofs involve complex structures or rigorous computation. We present a bijective proof of the formula by providing an elementary calculation of the probability that a cycle occurs in a random map from an $n$-element set to an $n+1$-element set.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.