Rainbow matchings in properly-colored hypergraphs

Hao Huang, Tong Li, Guanghui Wang

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$, \cdots, $H_s$ ar…