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

TL;DR

This paper explores a new problem in Ramsey theory, connecting covering and partitioning by monochromatic subgraphs, and provides initial results on vertex coverage by monochromatic matchings in multi-colored complete graphs.

Contribution

It introduces a novel problem linking monochromatic coverings and Ramsey problems, and proves a key case for matchings when the number of matchings is one less than the number of colors.

Findings

Determined the maximum vertices covered by s monochromatic matchings in t-colorings when s=t-1.

Proposed several open problems and conjectures in the area of monochromatic coverings.

Connected classical Ramsey problems with covering problems through a new framework.

Abstract

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) that must be present in any edge coloring of a complete graph K_n with t colors. Another area is to find the minimum number of monochromatic members of F that partition or cover the vertex set of every edge colored complete graph. Here we propose a problem that connects these areas: for fixed positive integers s,t, at least how many vertices can be covered by the vertices of no more than s monochromatic members of F in every edge coloring of K_n with t colors. Several problems and conjectures are presented, among them a possible extension of a well-known result of Cockayne and Lorimer on monochromatic matchings for which we prove an initial step: in case of s=t-1 we determine how many vertices can be covered by s monochromatic matchings in every t-coloring of K_n.