Perfect matchings in pruned grid graphs

We determine conditions sufficient to guarantee the existence of a perfect matching when vertices are removed from finite and infinite grid graphs. The conditions impose a minimum distance between the vertices that are removed. While the distances are likely not best possible, they are best possible with respect to asymptotic growth rate.