On the anti-Ramsey numbers of linear forests

Tian-Ying Xie, Long-Tu Yuan

For a fixed graph $F$, the $\text{anti-Ramsey number}$, $AR(n,F)$, is the maximum number of colors in an edge-coloring of $K_n$ which does not contain a rainbow copy of $F$. In t…