ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected bridgeless cubic graph of order at most 8k+88k+8 that does not admit any 33-edge-coloring.

Strengthened circular-flow conjecture.

Φc(G)≥4+1k.\Phi_c(G) \ge 4+\frac{1}{k}.

This conjecture strengthens the lower bound of Lukot'ka and Škoviéra for the circular flow number of non-33-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 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.