Abstract
The anti-Ramsey number a r n ( H ) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H. In this paper, we determine anti-Ramsey numbers for paths of length 2, certain stars and complete hypergraphs, and the complete 3-uniform hypergraph of order 4 with a single hyperedge removed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have