Anti-Ramsey number of matchings in $3$-uniform hypergraphs

Mingyang Guo, Hongliang Lu, Xing Peng

Let $n,s,$ and $k$ be positive integers such that $k\ge 3$, $s\ge 3$ and $n\ge ks$. An $s$-matching $M_s$ in a $k$-uniform hypergraph is a set of $s$ pairwise disjoint edges. Th…