Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 15 Oct 2026 in math.CO | (2610.22021v1)

Abstract: In 1985, Erd{ő}s, Frankl and F{ü}redi conjectured that the threshold T(r)T(r) for the existence of an rr-cover-free family with more members than points satisfies T(r)=(1+o(1))r<sup>2T(r)=(1+o(1))r<sup>2. We confirm this conjecture by proving T(r)≥r<sup>2+r+2T(r)\ge r<sup>2+r+2 for every r≥1r\ge1.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.