Triple
T29514456
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Graham–Pollak theorem |
E748752
|
entity |
| Predicate | equalityCase |
P169315
|
FINISHED |
| Object | There exists a partition of the edges of K_n into exactly n−1 complete bipartite subgraphs. |
—
|
LITERAL FINISHED |
Provenance (4 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f0bd461c208190bec20bbf24e02cc5 |
elicitation | completed |
| NER | batch_69f67de7792c81909b5e4e812d143624 |
ner | completed |
| PD | batch_69f678ce54b081908c26edfd49e39c60 |
pd | completed |
| PDg | batch_69f67d31cc60819084f64bd056e1ea4d |
pdg | completed |
Created at: April 28, 2026, 4:35 p.m.