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)