Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
directed graphs
finite undirected graphs |
| gptkbp:describes |
connectivity in graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Menger's theorem
|
| gptkbp:namedAfter |
gptkb:Karl_Menger
|
| gptkbp:publishedIn |
1927
|
| gptkbp:relatedTo |
gptkb:max-flow_min-cut_theorem
edge connectivity vertex connectivity |
| gptkbp:state |
the minimum number of vertices separating two nonadjacent vertices equals the maximum number of pairwise internally vertex-disjoint paths between them
the minimum number of edges separating two nonadjacent vertices equals the maximum number of pairwise edge-disjoint paths between them |
| gptkbp:usedIn |
combinatorics
algorithm design network reliability |
| gptkbp:bfsParent |
gptkb:Karl_Menger
gptkb:König's_theorem |
| gptkbp:bfsLayer |
6
|