On covering by translates of a set
In this paper we study the minimal number of translates of an arbitrary subset $S$ of a group $G$ needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing t...
Main Authors: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2009
|
Similar Items
-
The cut metric, random graphs, and branching processes
by: Bollobas, B, et al.
Published: (2009) -
Line-of-sight percolation
by: Bollobas, B, et al.
Published: (2007) -
Spread-out percolation in R^d
by: Bollobas, B, et al.
Published: (2005) -
The phase transition in inhomogeneous random graphs
by: Bollobas, B, et al.
Published: (2005) -
The phase transition in the uniformly grown random graph has infinite order
by: Bollobas, B, et al.
Published: (2005)