Theoremcore
MST optimality conditions
Theorem stating a spanning tree is minimal exactly when no non-tree edge is heavier than every edge on its tree cycle.
Theorem stating a spanning tree is minimal exactly when no non-tree edge is heavier than every edge on its tree cycle.
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 KY82A5 Edit this page History Report an error