当前位置:
X-MOL 学术
›
J. Comb. Theory A
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Rainbow matchings for 3-uniform hypergraphs
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2021-06-11 , DOI: 10.1016/j.jcta.2021.105489 Hongliang Lu , Xingxing Yu , Xiaofan Yuan
中文翻译:
3-均匀超图的彩虹匹配
更新日期:2021-06-11
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2021-06-11 , DOI: 10.1016/j.jcta.2021.105489 Hongliang Lu , Xingxing Yu , Xiaofan Yuan
Kühn, Osthus, and Treglown and, independently, Khan proved that if H is a 3-uniform hypergraph with n vertices, where and large, and , then H contains a perfect matching. In this paper, we show that for sufficiently large, if are 3-uniform hypergraphs with a common vertex set and for , then admits a rainbow matching, i.e., a matching consisting of one edge from each . This is done by converting the rainbow matching problem to a perfect matching problem in a special class of uniform hypergraphs.
中文翻译:
3-均匀超图的彩虹匹配
Kühn、Osthus 和 Treglown 以及独立的 Khan 证明了如果H是具有n个顶点的 3-均匀超图,其中 和大,和 ,则H包含完美匹配。在本文中,我们证明对于 足够大,如果 是具有公共顶点集的 3-uniform hypergraphs 和 为了 , 然后 承认彩虹匹配,即由每个边的一条边组成的匹配 . 这是通过将彩虹匹配问题转换为一类特殊的均匀超图中的完美匹配问题来完成的。