Claims

../

1977_08_01_frankl: Frankl (1977) proves that for k at least 4 and n large in terms of k, more than binom(n-2,k-2) k-subsets of an n-set include two meeting in one point; refereed, credited by the site's curator and formalized.

2026_08_18_alexeev: Answers the site's wording (every n), not the corrected Statement (n > n_0(k), Erdős's own range), so it does not count toward the problem's standing. A Lean theorem in Alexeev's repository refutes that wording at the five 4-subsets of a 5-set.

---