The probabilistic approach to limited packings in graphs

Andrei Gagarin, Vadim Zverovich

We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V(G)$, $\left|N[v] \cap X…