The anti-Ramsey numbers of cliques in complete multi-partite graphs

Yuyu An, Ervin Gyori, Binlong Li

A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. Let $G$ and $H$ be two graphs. The anti-Ramsey number $\ar(G, H)$ is the maximum number of…