ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a finite simple graph. A split of GG is a pair (X,Y)(X,Y) of disjoint sets whose union is VV. It is external if, after deleting all edges between XX and YY, every vertex has degree at most half its degree in GG. A graph is cubic if every vertex has degree 33.

Ban–Linial conjecture. Every cubic graph has an external split (X,Y)(X,Y) satisfying

−2≤∣X∣−∣Y∣≤2.-2 \leq |X|-|Y| \leq 2.

The conjecture asks for an external split that is nearly balanced, strengthening the existence of an external split supplied by any maximum edge-cut. The source proves the claim in two special cases: graphs decomposable into a cycle and a tree, and graphs having a cubic tree TT such that G−E(T)G-E(T) is bipartite. The supplied status evidence concerns a stronger conjecture, not this stated Ban–Linial conjecture itself.

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.