New bounds on the generalized Ramsey number $f(n,5,8)$

Enrique Gomez-Leos, Emily Heath, Alex Parker +2

Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\fra…