ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E,w)G=(V,E,w) be an edge-weighted graph with non-negative edge weights, and let w(G)w(G) denote the total edge weight. A bisection is a cut whose two parts differ in size by at most 11. Let kk be a positive integer and suppose that

Δ(G)≤k.\Delta(G)\leq k.

Bounded-degree bisection conjecture. If kk is odd, then GG has a bisection of weight at least

k+12kw(G),\frac{k+1}{2k}w(G),

and if kk is even, then GG has a bisection of weight at least

k+22(k+1)w(G).\frac{k+2}{2(k+1)}w(G).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.