Triple
T8669824
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Pál Turán |
E205766
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Turán's theorem
Turán's theorem is a fundamental result in extremal graph theory that determines the maximum number of edges a graph can have without containing a complete subgraph of a given size.
|
E750082
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca83516ae88190aefe034b3bc589e3 |
elicitation | completed |
| NER | batch_69cc4917cb9881909a73b74e54250613 |
ner | completed |
| NED1 | batch_69cecd2b996481908da33fbd95494376 |
ned_source_triple | completed |
| NED2 | batch_69cecff48600819086a15700cb947056 |
ned_description | completed |
| NEDg | batch_69cece8fcbcc8190832a66287bc8f833 |
nedg | completed |
Created at: March 30, 2026, 6:31 p.m.