Triple
T9838897
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | de Bruijn–van Aardenne–Ehrenfest theorem |
E239170
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
BEST theorem
The BEST theorem is a result in graph theory that gives a formula for counting the number of distinct Eulerian circuits in a directed graph using spanning arborescences and vertex degrees.
|
E824089
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca84e314108190978324a4bdb959f8 |
elicitation | completed |
| NER | batch_69cdb34921b881909836ba0f5b42a27b |
ner | completed |
| NED1 | batch_69d1d5d145ac8190ad10a4328216ef54 |
ned_source_triple | completed |
| NED2 | batch_69d1d726e58c819090135d1ff275d2d8 |
ned_description | completed |
| NEDg | batch_69d1d6bb23cc81909efbeccf147018e8 |
nedg | completed |
Created at: March 30, 2026, 8:33 p.m.