hasEdgeVersionStatement
P170154
predicate
Indicates that there exists a specific version-related statement associated with an edge in a graph or network.
Sample triples (1)
| Subject | Object |
|---|---|
|
Menger theorem in graph theory
surface form:
Menger's theorem (graph theory)
|
for any two distinct vertices s and t, the maximum number of pairwise edge-disjoint s–t paths equals the minimum size of an s–t edge cut ⓘ |