Anti-Ramsey numbers of small graphs

Abstract

The anti-Ramsey number $AR(n,G$), for a graph $G$ and an integer $n\ge |V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ whose edges have distinct colours. In this paper we determine the anti-Ramsey numbers of all graphs having at most four edges.

Cited by in corpus (3)

• Monochromatic graph decompositions inspired by anti-Ramsey theory and the odd-coloring problem
• Minimal colorings for properly colored subgraphs in complete graphs
• On the anti-Ramsey number of forests