Triple
T8657127
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ronald L. Graham |
E205446
|
entity |
| Predicate | notableIdea |
P4
|
FINISHED |
| Object |
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
|
E748752
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca8350897c819086cde7596fbe5fe7 |
elicitation | completed |
| NER | batch_69cc484569788190aa41395854684e6f |
ner | completed |
| NED1 | batch_69ceccec941881908263cd3205f10ccd |
ned_source_triple | completed |
| NED2 | batch_69cecf3a0e78819082cc7c43eceae309 |
ned_description | completed |
| NEDg | batch_69cece8c4bdc8190988990c675f50f86 |
nedg | completed |
Created at: March 30, 2026, 6:30 p.m.