Two problems of Burr, Erd\H os, Graham, and Sós on maximal anti-Ramsey functions for $P_4$

Abstract

Burr, Erd\H os, Graham, and Sós introduced the maximal anti-Ramsey function $χ_{\mathrm{S}}(n,e,L)$, the minimum number of colors required over all $n$-vertex graphs with at least $e$ edges such that every copy of $L$ is rainbow. In \cite{BEGS1989}, they posed the following two problems: (i) Is it true that there exists $C>0$, such that for all $u\ge 1$, $χ_{\mathrm{S}}\left(n,\lfloor un \rfloor,P_4 \right) 0$, there exists $c(ε)>0$ such that for all sufficiently large $n$, \\ $χ_{\mathrm{S}}\left(n,\binom{n}{2}-\lfloor n^{2-ε} \rfloor,P_4 \right)>c(ε)n^{2}$? In this note, we give an affirmative answer to the first problem and a negative answer to the second problem. For the first problem, our proof uses a local density inequality with strong edge-colorings of odd Kneser graphs. In particular, our proof uses the characterization by Lužar, Máčajová, Škoviera, and Soták of~$k$-regular graphs whose strong chromatic index equals~$2k-1$. For the second result, our main tool is the construction of Alon, Moitra, and Sudakov. We show that for every fixed~$0<ε<1/2$ there exist~$γ>0$ and arbitrarily large~$n$ such that~$χ_{\mathrm{S}}\bigl(n,\tbinom{n}{2}-\lfloor n^{2-ε}\rfloor,P_4\bigr)\;\le\; n^{2-γ}=o(n^{2}).$