 Planar girth edge bound

If every face of a connected planar graph has size at least $g>2$, double-counting edge-face incidences and using Euler's formula gives