Triple
T22423145
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Erdős–Ko–Rado theorem |
E554298
|
entity |
| Predicate | statement |
P4223
|
FINISHED |
| Object | For n ≥ 2k, the largest size of an intersecting family of k-subsets of an n-element set is C(n−1, k−1). |
—
|
LITERAL FINISHED |
Provenance (2 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69e11e4f2d0c819091aa3558ea2ee630 |
elicitation | completed |
| NER | batch_69f15a2af620819083338127e78137dc |
ner | completed |
Created at: April 16, 2026, 8:47 p.m.