跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

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 kk, with arbitrary nonnegative real edge weights, has a bisection of weight at least (k+1)/(2k)(k+1)/(2k) times its total edge weight. The corresponding bound (k+2)/(2(k+1))(k+2)/(2(k+1)) for even kk 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.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 kk, with arbitrary nonnegative real edge weights, has a bisection of weight at least (k+1)/(2k)(k+1)/(2k) times its total edge weight. The corresponding bound (k+2)/(2(k+1))(k+2)/(2(k+1)) for even kk 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.

查看此版本解读 →查看此版本原文 ↗