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