Complexity of Computing the Anti-Ramsey Numbers for Paths

@inproceedings{Amiri2020ComplexityOC,
title={Complexity of Computing the Anti-Ramsey Numbers for Paths},
author={S. Amiri and Alexandru Popa and M. Roghani and Golnoosh Shahkarami and R. Soltani and H. Vahidi},
booktitle={MFCS},
year={2020}
}

The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs $G$ and $H$ the \emph{anti-Ramsey number} $\textrm{ar}(G,H)$ is defined to be the maximum number $k$ such that there exists an assignment of $k$ colors to the edges of $G$ in which every copy of $H$ in $G$ has at least two edges with the same color.
There are works on the computational complexity of the problem when $H$ is a star. Along this line of… CONTINUE READING