Conceptio › Archive › arXiv (All)
arXiv (All) open access

The asymptotic Erd{ő}s--Frankl--Füredi cover-free conjecture

Huang, Xinqi et al.
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
05d05combinatorics
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

Record · ID 1357676
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