Almost-rainbow edge-colorings of some small subgraphs

Elliot Krop, Irina Krop

Let $f(n,p,q)$ be the minimum number of colors necessary to color the edges of $K_n$ so that every $K_p$ is at least $q$-colored. We improve current bounds on the {7/4}n-3$, slight…