The Ban–Linial conjecture for cubic graphs
Statement
Let be a finite simple graph. A split of is a pair of disjoint sets whose union is . It is external if, after deleting all edges between and , every vertex has degree at most half its degree in . A graph is cubic if every vertex has degree .
Ban–Linial conjecture. Every cubic graph has an external split satisfying
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 such that 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.