Theoremintro
Cycle property
Also called red rule.
The heaviest edge on any cycle belongs to no minimum spanning tree (for distinct weights).
The heaviest edge on any cycle belongs to no minimum spanning tree (for distinct weights).
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 NES9Z4 Edit this page History Report an error