Claims

../

2025_10_16_gao: For every k at least 3 and every constant C, a k-uniform hypergraph on enough vertices has at most n - C distinct clique sizes, so no 3-uniform hypergraph reaches n - O(1); accepted by the site, with third-party Lean.

---