Triple
T29045091
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Menger's theorem (graph theory) |
E735111
|
entity |
| Predicate | implies |
P1661
|
FINISHED |
| Object | a graph is k-vertex-connected if and only if every pair of vertices has at least k internally vertex-disjoint paths between them |
—
|
LITERAL FINISHED |
Provenance (2 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f077e64b88819094d37bdbca8191b3 |
elicitation | completed |
| NER | batch_69f66060f3508190af8c48526206c8cc |
ner | completed |
Created at: April 28, 2026, 10:04 a.m.