Theoremcore
Cayley's formula
Also called Cayley's tree formula, labeled trees count n^(n-2).
There are n^(n-2) labeled trees on n vertices.
There are n^(n-2) labeled trees on n vertices.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag SQY9VT Edit this page History Report an error