On the size of maximum cut in planar graphs

01/22/2023

∙

by   Pranay Gorantla, et al.

∙

0

∙

share

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.