Back to Feed
Erd\H{o}s Matching (Conjecture) Theorem

arXiv:2602.01471v5 Announce Type: replace Abstract: Let $\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erd\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, assert...

🔗 Read more: https://arxiv.org/abs/2602.01471

#News #Math #WorldNews #Policy #Academic
Edited

Comments

No comments yet. Be the first to comment!