Abstract
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 numberAR(G,H) of a hypergraph H 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 H. 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
