Strong Erdős–Frankl–Füredi cover-free conjecture
For an integer , let be the least integer for which there exists a family of nonempty subsets of an -element set such that and, for every choice of distinct sets , . The conjecture asserts that for every integer .
References
- A proof of the strong Erdős--Frankl--Füredi cover-free conjecture — arXiv — Yanan Hu, Leilei Zhang
Source: arXiv
Progress summary
An unrefereed preprint claims to settle the conjecture, but the claim has not been independently checked.
The conjecture concerns the exact threshold for the first nontrivial -cover-free family, namely whether for every positive integer . The retrieved record includes an earlier result proving only the asymptotic form, so the new claim is the first directly relevant assertion of a complete solution.
October 17, 2026 claimed proof
Yanan Hu and Leilei Zhang claim in an unrefereed preprint that the universal lower bound for the strong conjecture holds for all positive integers , which would settle the conjecture and recover equality in the prime-power cases. A separate recent preprint proves and , but explicitly says that remains unsettled; the relationship between these records is unresolved in the retrieved material.
Current status (as of October 2026): A preprint claims the strong conjecture is solved, but the claim is unverified; the exact bound is not independently established in the retrieved evidence.
Solutions 0
No solutions have been posted yet.