Triple
T6834501
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Noga Alon |
E157415
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Alon–Tarsi conjecture
The Alon–Tarsi conjecture is a prominent open problem in combinatorics and graph theory concerning orientations and colorings of graphs, with deep connections to Latin squares and polynomial method techniques.
|
E621147
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c6882c53608190b99aebef079b23bd |
elicitation | completed |
| NER | batch_69c6d67936288190829fedc3729aadd8 |
ner | completed |
| NED1 | batch_69c723fd50c88190af005fd58ca0aee6 |
ned_source_triple | completed |
| NED2 | batch_69c7253b94f081909e7cee870a12af6b |
ned_description | completed |
| NEDg | batch_69c7247806808190ac60c134cec612c8 |
nedg | completed |
Created at: March 27, 2026, 2:18 p.m.