hasEdgeVersionStatement
P170154
predicate
Indicates that there exists a specific version-related statement associated with an edge in a graph or network.
All labels observed (1)
| Label | Occurrences |
|---|---|
| hasEdgeVersionStatement canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: hasEdgeVersionStatement
Generated description
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 ⓘ |