Generalized Ramsey numbers: forbidding paths with few colors

Robert A. Krueger

Let $f(K_n,H,q)$ be the minimum number of colors needed to edge-color $K_n$ so that every copy of $H$ is colored with at least $q$ colors. Originally posed by Erdős and Shelah wh…