Covering complete graphs by monochromatically bounded sets
Covering complete graphs by monochromatically bounded sets
Given a k-colouring of the edges of the complete graph Kn, are there k-1 monochromatic components that cover its vertices? This important special case of the well-known Lov?sz-Ryser conjecture is still open. In this paper we consider a strengthening of this question, where we insist that the covering sets are …