Key points are not available for this paper at this time.
Let G = (V, E) be an n-vertex graph and let c: E N be a coloring of its edges. Let dᶜ (v) be the number of distinct colors on the edges at v V and let ᶜ (G) = ₕ ₕ \ d^{c (v) \}. H. Li proved that ᶜ (G) > n/2 guarantees a rainbow triangle in G. We give extensions of Li's result to cliques Kᵣ for r 4.
Czygrinow et al. (Wed,) studied this question.