Triple
T29045109
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Menger's theorem (graph theory) |
E735111
|
entity |
| Predicate | hasEdgeVersionStatement |
P170154
|
FINISHED |
| Object | 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 |
—
|
LITERAL FINISHED |
Provenance (4 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f077e64b88819094d37bdbca8191b3 |
elicitation | completed |
| NER | batch_69f68b121eac81909e90416207bc1157 |
ner | completed |
| PD | batch_69f6860def1c81909d79e1f088c4b5e5 |
pd | completed |
| PDg | batch_69f68a160374819084d720985f800dfc |
pdg | completed |
Created at: April 28, 2026, 10:04 a.m.