Stability for the Anti-Ramsey Number of Matchings

Xuechun Zhang, Hongliang Lu

Let $n,r,s$ be three positive integers such that $n\ge 2s+5$. Let $K_r$ denote the complete graph of order $r$. Given a graph $F$, the anti-Ramsey number $ar(n,F)$ is defined as…