Definitioncore
Splits of a tree
Also called bipartitions, splits.
Each edge of an unrooted tree splits the leaf set into two parts; the set of splits determines the tree.
Each edge of an unrooted tree splits the leaf set into two parts; the set of splits determines the tree.
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 Z6WYX9 Edit this page History Report an error