On the anti-Ramsey threshold for non-balanced graphs

Pedro Araújo, Taísa Martins, Letícia Mattos +3

For graphs $G$ and $H$, we write $G\stackrel{\mathrm{rb}}{⟶}H$ if any proper edge-coloring of $G$ contains a rainbow copy of $H$, i.e., a copy where no color appear…