Triple
T2169630
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | N. G. de Bruijn |
E46991
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
de Bruijn–van Aardenne–Ehrenfest theorem
The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
|
E239170
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a88a184cbc8190877791f6552c2484 |
elicitation | completed |
| NER | batch_69abbeaeb58881908ad34f7b253bac2a |
ner | completed |
| NED1 | batch_69ae58f511a08190880fbde8900d59df |
ned_source_triple | completed |
| NED2 | batch_69ae5a12f11c81908cc345905f0a485e |
ned_description | completed |
| NEDg | batch_69ae59a9b010819081491e988184b386 |
nedg | completed |
Created at: March 4, 2026, 7:45 p.m.