Rainbow matchings in properly-colored hypergraphs (Q668047)

Summary: A hypergraph \(H\) is properly colored if for every vertex \(v\in V(H)\), all the edges incident to \(v\) have distinct colors. In this paper, we show that if \(H_{1}, \dots, H_{s}\) are properly-colored \(k\)-uniform hypergraphs on \(n\) vertices, where \(n\geq 3k^{2}s\), and \(e(H_{i})>\binom{n}{k}-\binom{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 Erdős matching conjecture.