  The dominance complex $D(G)$ of a simple graph $G = (V,E)$ is the simplicial
complex consisting of the subsets of $V$ whose complements are dominating. We
show that the connectivity of $D(G)$ plus $2$ is a lower bound for the vertex
cover number $\tau(G)$ of $G$.
