JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES
|
2005年
/
71卷
关键词:
D O I:
10.1112/S0024610704005976
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Assume that G is a group covered by countably many sets X-n, n < omega. It is proved that G is generated in two or three steps by a small number of the sets X-n. These results are generalized for countable coverings of types and countable colourings of graphs.