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...
Главные авторы: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
2009
|
Схожие документы
-
The cut metric, random graphs, and branching processes
по: Bollobas, B, и др.
Опубликовано: (2009) -
The phase transition in the uniformly grown random graph has infinite order
по: Bollobas, B, и др.
Опубликовано: (2005) -
Sparse random graphs with clustering
по: Bollobas, B, и др.
Опубликовано: (2008) -
The phase transition in inhomogeneous random graphs
по: Bollobas, B, и др.
Опубликовано: (2005) -
Line-of-sight percolation
по: Bollobas, B, и др.
Опубликовано: (2007)