  Given a graph $G$ we consider sequentially placing dimers on it, namely
choosing a maximal independent subset of edges, i.e. edges that do not share
common vertices. We study the number of vertices that do not belong to any edge
found in the maximal set. We prove a CLT result for this model in the case when
the underlying graph is $\mathbb{Z}^d$.
