1 paper
Fangfang Wu, Shenggui Zhang, Binlong Li +1
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number…