Anti-Ramsey number of matchings in a hypergraph

Given an edge-coloring of a hypergraph g, g is said to be rainbow if any two edges of g receive different colors. The anti-Ramsey number AR(g, 7-t) of a hypergraph 7-t in a hypergraph g is defined to be the maximum integer k such that there exists a k-edge coloring of g avoiding rainbow copies of 7-t. The anti-Ramsey numbers of matchings have been extensively studied in several graph classes. But there is few results in hypermatchings and up to now, we only know the anti-Ramsey number of matchings, paths and cycles in complete uniform hypergraphs. In this paper, we determine the exact value of the anti-Ramsey number of a k-matching in a complete tripartite 3-uniform hypergraph. Interestingly, our results are parallel to the results in complete bipartite graphs. (C) 2021 Elsevier B.V. All rights reserved.