Hostname: page-component-76fb5796d-22dnz Total loading time: 0 Render date: 2024-04-26T19:18:25.775Z Has data issue: false hasContentIssue false
  • English
  • Français

COVERINGS OF GROUPS AND TYPES

Published online by Cambridge University Press:  04 February 2005

LUDOMIR NEWELSKI  and
MARCIN PETRYKOWSKI
LUDOMIR NEWELSKI
Affiliation:
Mathematical Institute, Wrocław University, pl. Grunwaldzki 2/4, 50-384 Wrocław, Polandnewelski@math.uni.wroc.pl, petryk@math.uni.wroc.pl
MARCIN PETRYKOWSKI
Affiliation:
Mathematical Institute, Wrocław University, pl. Grunwaldzki 2/4, 50-384 Wrocław, Polandnewelski@math.uni.wroc.pl, petryk@math.uni.wroc.pl
Get access

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.

Keywords

03C0703C45 (primary)05C1520F99 (secondary)
Type
Notes and Papers
Information
Journal of the London Mathematical Society , Volume 71 , Issue 1 , February 2005 , pp. 1 - 21
Copyright
The London Mathematical Society 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)