COVERINGS OF GROUPS AND TYPES

Assume that G is a group covered by countably many sets Xn, n<ω. It is proved that G is generated in two or three steps by a small number of the sets Xn. These results are generalized for countable coverings of types and countable colourings of graphs.