论文标题
$ k $ - 明确超图中的彩虹匹配
Rainbow matchings in $k$-partite hypergraphs
论文作者
论文摘要
在本文中，我们证明了Aharoni和Howard对足够大的家庭中的彩虹（横向）比赛的存在$ \ Mathcal f_1，\ ldots，\ Mathcal f_s f_s $ a $ \ \ \ \ \ {1，\ ldots，n \}^k $，$ s \ $ s \ ge 4770.
In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families $\mathcal F_1,\ldots, \mathcal F_s$ of tuples in $\{1,\ldots, n\}^k$, provided $s\ge 470.$
