Coverings by few monochromatic pieces - a transition between two Ramsey problems

András Gyárfás, Gábor N. Sárközy, Stanley Selkow

The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs…