András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow. Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems. Graphs and Combinatorics, 31(1):131-140, 2015. [doi]
@article{GyarfasSS15,
title = {Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems},
author = {András Gyárfás and Gábor N. Sárközy and Stanley M. Selkow},
year = {2015},
doi = {10.1007/s00373-013-1372-2},
url = {http://dx.doi.org/10.1007/s00373-013-1372-2},
researchr = {https://researchr.org/publication/GyarfasSS15},
cites = {0},
citedby = {0},
journal = {Graphs and Combinatorics},
volume = {31},
number = {1},
pages = {131-140},
}