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)