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...
Hoofdauteurs: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Formaat: | Journal article |
Taal: | English |
Gepubliceerd in: |
2009
|
Gelijkaardige items
-
The cut metric, random graphs, and branching processes
door: Bollobas, B, et al.
Gepubliceerd in: (2009) -
The phase transition in the uniformly grown random graph has infinite order
door: Bollobas, B, et al.
Gepubliceerd in: (2005) -
Sparse random graphs with clustering
door: Bollobas, B, et al.
Gepubliceerd in: (2008) -
The phase transition in inhomogeneous random graphs
door: Bollobas, B, et al.
Gepubliceerd in: (2005) -
Line-of-sight percolation
door: Bollobas, B, et al.
Gepubliceerd in: (2007)