Triple
T29045108
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Menger's theorem (graph theory) |
E735111
|
entity |
| Predicate | hasGlobalVertexVersionStatement |
P166541
|
FINISHED |
| Object | the vertex connectivity of a finite graph equals the minimum, over all pairs of distinct vertices, of the size of a smallest vertex cut separating them |
—
|
LITERAL FINISHED |
Provenance (4 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f077e64b88819094d37bdbca8191b3 |
elicitation | completed |
| NER | batch_69f6622808b48190bbabcc75288ab031 |
ner | completed |
| PD | batch_69f660f082508190a95a7888ad66cb2e |
pd | completed |
| PDg | batch_69f6617a7e7c81908cfac4a2250797ee |
pdg | completed |
Created at: April 28, 2026, 10:04 a.m.