arXiv (All)
open access
The asymptotic Erd{ő}s--Frankl--Füredi cover-free conjecture
In 1985, Erd{ő}s, Frankl and F{ü}redi conjectured that the threshold $T(r)$ for the existence of an $r$-cover-free family with more members than points satisfies $T(r)=(1+o(1))r^2$. We confirm this conjecture by proving $T(r)\ge r^2+r+2$ for every $r\ge1$.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A proof of the rational exponents conjecture#1344210
- A short proof of the Erd\H os--Sós Conjecture#1012373
- A Kernel-Certified Verification of the Erdős-Mollin-Walsh Conjecture below $10^{14}$#1051504
- Sparse Approximate Chromatic Profiles of Triangle-Free Graphs#1063363
- Sharp and Growing Linear-Excess Inverse Theorems for Sets with Few Subset Sums#1097482
Record · ID 1357676
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive