Edge-coloring cliques with many colors on subcliques (Q5928597)

\textit{D. Mubayi} [Combinatorica 18, No. 2, 293-296 (1998; Zbl 0910.05035)] constructed a coloring of \(E(K_N)\) with \(e^{O(\sqrt{\log n})}\) colors in which the edges of every copy of \(K_4\) get together at least three colors. It is shown in this paper that this construction has also the property that the edges of every copy of \(K_p\) get together at least \(2\lceil{\log_2 p}\rceil -2\) colors.