Resumen de Coverings of groups and types

Ludomir Newelski, Marcin Petrykowski

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