Article contents
COVERINGS OF GROUPS AND TYPES
Published online by Cambridge University Press: 04 February 2005
Abstract
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.
- Type
- Notes and Papers
- Information
- Copyright
- The London Mathematical Society 2005
- 3
- Cited by