Problemcore
Vertex-disjoint paths
Also called Node-disjoint paths.
Finds the largest number of paths between two vertices that share no internal vertex, equal to the minimum vertex cut by Menger's theorem.
Finds the largest number of paths between two vertices that share no internal vertex, equal to the minimum vertex cut by Menger's theorem.
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 S1FZT0 Edit this page History Report an error