Planar girth edge bound
= 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
$$
e\leq\frac{g(n-2)}{g-2}.
$$
= 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
$$
e\leq\frac{g(n-2)}{g-2}.
$$