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]

Authors

András Gyárfás

This author has not been identified. Look up 'András Gyárfás' in Google

Gábor N. Sárközy

This author has not been identified. Look up 'Gábor N. Sárközy' in Google

Stanley M. Selkow

This author has not been identified. Look up 'Stanley M. Selkow' in Google