Some results around the Erdős Matching Conjecture
Main Article Content
Abstract
More than 50 years ago, Erd\H{o}s asked the following question: what is the largest family of $k$-element subsets of $[n]$ with no $s$ pairwise disjoint sets? In this abstract, we discuss recent progress on this problem and its generalizations.
Article Details
How to Cite
Frankl, P., & Kupavskii, A.
(2019).
Some results around the Erdős Matching Conjecture.
Acta Mathematica Universitatis Comenianae, 88(3), 695-699.
Retrieved from http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1284/714
Issue
Section
EUROCOMB 2019