Sárközy, G. N., and S. Selkow. “On Edge Colorings With at Least Q Colors in Every Subset of P Vertices”. The Electronic Journal of Combinatorics, Vol. 8, no. 1, Dec. 2000, p. R9, doi:10.37236/1553.