Fundamental cycles in grid graphs

We show that the average length of a fundamental cycle with respect to any fixed spanning tree of the $n\times n$ square grid is at least $\mathrm{\Omega }(\log n)$; the bound is asymptotically tight. This result answers in the affirmative a question posed by McCarty in relation to sparse representations of binary matroids.