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...
Hlavní autoři: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Médium: | Journal article |
Jazyk: | English |
Vydáno: |
2009
|
Podobné jednotky
-
The cut metric, random graphs, and branching processes
Autor: Bollobas, B, a další
Vydáno: (2009) -
The phase transition in the uniformly grown random graph has infinite order
Autor: Bollobas, B, a další
Vydáno: (2005) -
Sparse random graphs with clustering
Autor: Bollobas, B, a další
Vydáno: (2008) -
The phase transition in inhomogeneous random graphs
Autor: Bollobas, B, a další
Vydáno: (2005) -
Line-of-sight percolation
Autor: Bollobas, B, a další
Vydáno: (2007)