  Among subgraphs with a fixed number of vertices of the regular square
lattice, we prove inequalities that essentially say that those with smaller
boundaries have larger numbers of spanning trees and vice-versa. As an
application, we relate two commonly used measurements of the compactness of
district maps.
