Definitionintro
Cut
Partition of a graph's vertices into two disjoint sets, used to reason about crossing edges in spanning trees and flows.
Partition of a graph's vertices into two disjoint sets, used to reason about crossing edges in spanning trees and flows.
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 J9FYN4 Edit this page History Report an error