On the size of maximum cut in planar graphs

Abstract

We show that the size of maximum cut in a planar graph with $m$ edges is at least $2m/3$. We also show that maximal planar graphs saturate this bound.

The main result already appeared in an answer to a question posted on math stack exchange in 2016