Triple
T8454639
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Karl Menger |
E199889
|
entity |
| Predicate | notableFor |
P22
|
FINISHED |
| Object |
Menger theorem in graph theory
Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
|
E735111
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca8318231881908fd1bc1c4d45d286 |
elicitation | completed |
| NER | batch_69cbe48ca9988190b60ebd09a135194d |
ner | completed |
| NED1 | batch_69ce1de232508190803fd2dad21e677f |
ned_source_triple | completed |
| NED2 | batch_69ce209338b48190ba8375200a5529bd |
ned_description | completed |
| NEDg | batch_69ce1f88d404819096c6024c0e61d1ea |
nedg | completed |
Created at: March 30, 2026, 6:10 p.m.