Abstract
The set-coloring Ramsey number R(n;r,s,t) is the least N such that every assignment of an s-element subset of [r]={1,…,r} to each edge of KN contains a Kn whose edge labels have at least t common colors. Motivated by the work of Erdős and Szemerédi on R(n;r,r−1,1), we write R(n;r,r−1,t)=exp(nfr,n(t)) and study f(t):=fr,n(t) as t ranges from 1 to r−1. For fixed integers r≥2 and 1≤t<r, we prove that, as n→∞, 21logr−tr+o(1)≤f(t)≤r−trlogr−tr+C+Or,t(nlogn), where C>0 is an absolute constant. Comparisons between different numbers of colors show that the rates liminfn→∞fr,n(t) and limsupn→∞fr,n(t), defined for fixed r and t, each have a limit as r→∞ and rt→α∈(0,1) from above. The resulting two functions of α are finite, positive, nondecreasing, and right-continuous. Writing Δt=f(t+1)−f(t), we further prove that, as r→∞, uniformly for n≥r2, at least loglogr(1−o(1))logr indices 1≤t<2r satisfy Δt≥2r1−o(1). For r,n≥3 and 2≤h≤r−1, the final h−1 increments account for at least 1−⌈h/2⌉1 of the total increase f(r−1)−f(1). For each fixed r≥4, the last increment has a positive lower limit as n→∞. Moreover, for r,n≥3, it exceeds the sum of all preceding increments whenever r is even or n=3.