Maximum-weight bisection bound for graphs of bounded maximum degree
Statement
Let be an edge-weighted graph with non-negative edge weights, and let denote the total edge weight. A bisection is a cut whose two parts differ in size by at most . Let be a positive integer and suppose that
Bounded-degree bisection conjecture. If is odd, then has a bisection of weight at least
and if is even, then has a bisection of weight at least
The corresponding bounds are known for maximum cuts and are tight there for complete graphs; the conjecture asks whether they also hold for maximum-weight bisections. The paper notes that the conjecture holds for weighted subcubic graphs and almost all graphs, while the general case remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.