We say that the families $mathcal F_1,ldots, mathcal F_{s+1}$ of $k$-element subsets of $[n]$ are cross-dependent if there are no pairwise disjoint sets $F_1,ldots, F_{s+1}$, where $F_iin mathcal F_i$ for each $i$. The rainbow version of the ErdH os Matching Conjecture due to Aharoni and Howard and independently to Huang, Loh and Sudakov states that $min_{i} |mathcal F_i|le maxbig{{nchoose k}-{n-schoose k}, {(s+1)k-1choose k}big}$. In this paper, we prove this conjecture for $n>3e(s+1)k$ and $s>10^7$. One of the main tools in the proof is a concentration inequality due to Frankl and the author.
Download