Anti-Ramsey number of matchings in $r$-partite $r$-uniform hypergraphs

Yisai Xue, Erfang Shan, Liying Kang

An edge-colored hypergraph is rainbow if all of its edges have different colors. Given two hypergraphs $\mathcal{H}$ and $\mathcal{G}$, the anti-Ramsey number $ar(\mathcal{G}, \mat…