Problemcore
Labeled tree generation
Also called Enumerating labeled trees.
Enumerate all trees on the vertex set {1..n}; there are n^(n-2) of them.
Enumerate all trees on the vertex set {1..n}; there are n^(n-2) of them.
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 2AZG8Y Edit this page History Report an error