On edge colorings with at least $q$ colors in every subset of $p$ vertices.

Sárközy, Gábor N., and Selkow, Stanley. "On edge colorings with at least colors in every subset of vertices.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper R9, 6 p.-Research paper R9, 6 p.. <http://eudml.org/doc/120919>.

@article{Sárközy2001,
author = {Sárközy, Gábor N., Selkow, Stanley},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {edge coloring; monochromatic matching; probabilistic upper bound},
language = {eng},
number = {1},
pages = {Research paper R9, 6 p.-Research paper R9, 6 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On edge colorings with at least colors in every subset of vertices.},
url = {http://eudml.org/doc/120919},
volume = {8},
year = {2001},
}

TY - JOUR
AU - Sárközy, Gábor N.
AU - Selkow, Stanley
TI - On edge colorings with at least colors in every subset of vertices.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 1
SP - Research paper R9, 6 p.
EP - Research paper R9, 6 p.
LA - eng
KW - edge coloring; monochromatic matching; probabilistic upper bound
UR - http://eudml.org/doc/120919
ER -