Paperlane

no. 17 · Wednesday 18 November 2026

Sharp lower bounds for weighted bisections of graphs with bounded maximum degree

Stefanie Gerke, Gregory Gutin, Anders Yeo and Yacong Zhou

math.CO

Abstract

A bisection of a graph is a partition of its vertex set into two parts the sizes of which differ by at most one. We prove that every finite simple graph of maximum degree at most an odd positive integer $k$, with arbitrary nonnegative real edge weights, has a bisection of weight at least $(k+1)/(2k)$ times its total edge weight. The corresponding bound $(k+2)/(2(k+1))$ for even $k$ follows immediately. Both coefficients are best possible. Somewhat surprisingly, these are exactly the sharp coefficients known for maximum weighted cuts, despite the additional balance requirement.

fields
Combinatorics
pdf ↗ page arXiv:2611.22760 ↗