标题:Rainbow matchings in properly-colored hypergraphs
作者:Huang, Hao; Li, Tong; Wang, Guanghui
作者机构:[Huang, Hao] Emory Univ, Dept Math & CS, Atlanta, GA 30322 USA.; [Li, Tong; Wang, Guanghui] Shandong Univ, Dept Math, Jinan, Shandong, Peoples R Chi 更多
通讯作者:Huang, H
通讯作者地址:[Huang, H]Emory Univ, Dept Math & CS, Atlanta, GA 30322 USA.
来源:ELECTRONIC JOURNAL OF COMBINATORICS
出版年:2019
卷:26
期:1
摘要:A hypergraph H is properly colored if for every vertex v is an element of V(H), all the edges incident to v have distinct colors. In this paper, we show that if H-1, ..., H-s are properly-colored k-uniform hypergraphs on n vertices, where n >= 3k(2)s, and e(H-i) > ((n)(k)) - ((n)(-s)(+1)(k)), then there exists a rainbow matching of size s, containing one edge from each H-i. This generalizes some previous results on the Erdos Matching Conjecture.
收录类别:SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061531133&partnerID=40&md5=776de676498e0630beb9ae00b677cd52
TOP