Triple
T10944627
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Lajos Pósa |
E258562
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Pósa’s theorem in graph theory
Pósa’s theorem in graph theory is a result that gives a sufficient degree condition for a finite graph to contain a Hamiltonian cycle.
|
E895558
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d6aa8769b4819082bfe5e61b9017f0 |
elicitation | completed |
| NER | batch_69d770c4d59481908a5900fc8cf9ecc3 |
ner | completed |
| NED1 | batch_69e23c2dea008190af68336a096b7f7c |
ned_source_triple | completed |
| NED2 | batch_69e248f7f96481909fa6e6cd07891566 |
ned_description | completed |
| NEDg | batch_69e24542b4f081909c97621f04da8ecc |
nedg | completed |
Created at: April 8, 2026, 9:23 p.m.