Generalized Ramsey numbers at the linear and quadratic thresholds

Patrick Bennett, Ryan Cushman, Andrzej Dudek

The generalized Ramsey number $f(n,p,q)$ is the smallest number of colors needed to color the edges of the complete graph $K_n$ so that every $p$-clique spans at least $q$ colors…