Theoremadvanced
Bound on the number of minimum cuts
Also called Karger's cut-count bound.
A graph on n vertices has at most n(n-1)/2 minimum cuts, shown by analysing the contraction algorithm.
A graph on n vertices has at most n(n-1)/2 minimum cuts, shown by analysing the contraction algorithm.
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 7P1NFC Edit this page History Report an error