Triple
T29562849
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Turán's theorem |
E750082
|
entity |
| Predicate | statementInformal |
P4223
|
FINISHED |
| Object | Among all n-vertex graphs with no K_r subgraph, the Turán graph T_{r-1}(n) has the maximum number of edges |
—
|
LITERAL FINISHED |
Provenance (2 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f0bd4919e48190942b2a13d5b97d03 |
elicitation | completed |
| NER | batch_69f66d1e64e8819080579603e5bcdeb7 |
ner | completed |
Created at: April 28, 2026, 5:21 p.m.