Triple
T16983577
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Alan Hoffman |
E412003
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object |
Hoffman bound in graph theory
The Hoffman bound in graph theory is a spectral bound that uses the eigenvalues of a graph’s adjacency matrix to give an upper limit on the size of its maximum independent set (and related parameters like the chromatic number).
|
E1243904
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d886ca8f348190812768ea8d5055ce |
elicitation | completed |
| NER | batch_69e3d188ede48190baead48aac84c78d |
ner | completed |
| NED1 | batch_6a00dc0f13c88190b55da5be40a0a476 |
ned_source_triple | completed |
| NED2 | batch_6a0114e04e00819093805024f8417fad |
ned_description | completed |
| NEDg | batch_6a00dc96a9588190b020fd7fd1deee2b |
nedg | completed |
Created at: April 10, 2026, 5:32 a.m.