Triple
T29045107
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Menger's theorem (graph theory) |
E735111
|
entity |
| Predicate | hasLocalVertexVersionStatement |
P186461
|
FINISHED |
| Object | for any two nonadjacent vertices s and t, the maximum number of pairwise internally vertex-disjoint s–t paths equals the minimum size of an s–t vertex cut |
—
|
LITERAL FINISHED |
Provenance (4 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f077e64b88819094d37bdbca8191b3 |
elicitation | completed |
| NER | batch_69f9fe1a1ca4819084c196f0041f0be2 |
ner | completed |
| PD | batch_69f7cf769338819092a5f42653dcc956 |
pd | completed |
| PDg | batch_69f9fd66eed48190bdc26a8def328c2d |
pdg | completed |
Created at: April 28, 2026, 10:04 a.m.