ABSTRACT A ‐ coloring of is a coloring of the edges of such that every ‐clique has at least distinct colors among its edges. The generalized Ramsey number is the minimum number of colors such that has a ‐coloring. Gomez‐Leos, Heath, Parker, Schweider and Zerbib recently proved . Here we prove an asymptotically matching upper bound.
Bennett et al. (Sun,) studied this question.