Triple
T2426179
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | John H. Conway |
E53530
|
entity |
| Predicate | hasConcept |
P531
|
FINISHED |
| Object |
Conway's thrackle conjecture
Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
|
E266111
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ab495c44d48190b7235b23719bc3f6 |
elicitation | completed |
| NER | batch_69abc99b95548190b77d36de9adfe3bb |
ner | completed |
| NED1 | batch_69aebf637be4819096874a24e87f84ab |
ned_source_triple | completed |
| NED2 | batch_69aec87df0648190b8099b4eaa3d9b22 |
ned_description | completed |
| NEDg | batch_69aec7698e9881909c75137cb5cf2a0c |
nedg | completed |
Created at: March 6, 2026, 9:42 p.m.