The stronger Ban–Linial conjecture for orientable bisections
Statement
Let be a cubic graph that admits a perfect matching. An orientable -weak bisection is a -weak bisection with the orientability property used in the source; a -flow is the corresponding flow notion. Stronger Ban–Linial conjecture. Every cubic graph that admits a perfect matching, other than the Petersen graph, admits an orientable -weak bisection and, equivalently, a -flow. This is proposed as a strengthening of the revised Ban–Linial conjecture; the source does not state whether it has been resolved.
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.