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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.