Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.