arXiv · 2611.22760
Sharp lower bounds for weighted bisections of graphs with bounded maximum degree
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou. 2026-11-17. Sharp lower bounds for weighted bisections of graphs with bounded maximum degree. https://searcharxiv.com/abs/2611.22760
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.