← 研踪 PaperTrailarXiv:2611.22760 · v1
Sharp lower bounds for weighted bisections of graphs with bounded maximum degree
首次提交 2026-11-17 21:26
版本更新 2026-11-17 21:26
雷达观测 2026-11-18 19:41
摘要
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 , with arbitrary nonnegative real edge weights, has a bisection of weight at least times its total edge weight. The corresponding bound for even 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.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 21:26 · 最新观测版本
Sharp lower bounds for weighted bisections of graphs with bounded maximum degree
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 , with arbitrary nonnegative real edge weights, has a bisection of weight at least times its total edge weight. The corresponding bound for even 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.
查看此版本解读 →查看此版本原文 ↗