Abstract
Let [n]r be the complete r-partite hypergraph with vertex classes of size n. It is an easy exercise to show that every set of more than (k−1)nr−1 edges in [n]r contains a matching of size k. We conjecture the following rainbow version of this observation: if F1,F2,. . .,Fk ⊆ [n]r are of size larger than (k−1)nr−1 then there exists a rainbow matching, that is, a choice of disjoint edges fi ∈ Fi. We prove this conjecture for r=2 and r=3.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference11 articles.
1. Aharoni R. and Howard D. Cross-intersecting pairs of hypergraphs. To appear in J. Combin. Th. Ser. A.
2. A new generalization of the Erdös-Ko-Rado theorem
3. Meshulam R. Private communication.
4. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献