The $2$-Packing Number of Complete Grid Graphs

Abstract

Hare and Hare conjectured the 2-packing number of an $m\times n$ grid graph to be $\lceil \frac{mn}{5}\rceil$ for $m,n\ge 9$. This is verified by finding the 2-packing number for grid graphs of all sizes.