Sárközy, G. N., & Selkow, S. (2000). On Edge Colorings with at Least q Colors in Every Subset of p Vertices. The Electronic Journal of Combinatorics, 8(1), R9. https://doi.org/10.37236/1553