Asymptotic Erdős Matching Conjecture
Fix an integer and a positive real number . Let denote the maximum size of a -uniform family on whose matching number is less than . Asymptotic Erdős Matching Conjecture. One has
This is the linear-density asymptotic relaxation of the Erdős Matching Conjecture, comparing the limiting densities of its two natural constructions. The source supplies no resolution status.
References
- Peter Frankl and Andrey Kupavskii, “The Erdős Matching Conjecture and concentration inequalities”, arXiv:1806.08855 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.