Strengthened lower-bound conjecture for the circular flow number of snarks
Statement
Let be a connected bridgeless cubic graph of order at most that does not admit any -edge-coloring.
Strengthened circular-flow conjecture.
This conjecture strengthens the lower bound of Lukot'ka and Škoviéra for the circular flow number of non--edge-colorable cubic graphs. The paper reports computational evidence for it, but no proof or resolution is given.
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.