Claims
| Claim | Type | Assessment | Score | Review checks | References |
|---|---|---|---|---|---|
| The September 2026 Erdős–Chvátal simplex conjecture preprint states that if 2≤d<k and (d+1)k≤dv, every d-simplex-free family of k-subsets of [v] has at most binom(v−1,k−1) members, with equality only for a full star. | TEXTUAL | Supported | 0.8581 | 1 of 4 | 76 |