Strengthened lower-bound conjecture for the circular flow number of snarks
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.
References
- Jan Goedgebeur, Davide Mattiolo and Giuseppe Mazzuoccolo, “An algorithm and new bounds for the circular flow number of snarks”, arXiv:1909.09870 (2019).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.