The flow conjecture for 3-edge-connected cubic graphs excluding the Petersen graph
The flow conjecture for 3-edge-connected cubic graphs excluding the Petersen graph
Let be a 3-edge-connected cubic graph different from the Petersen graph . A nowhere-zero -flow is a flow satisfying flow conservation at every vertex. Flow conjecture for 3-edge-connected cubic graphs excluding . There exist such that
is a matching in , and there is no edge of for which is incident to an edge and is incident to an edge satisfying and . If true, this would provide the flow-based route proposed in the paper toward the normal 6-edge-coloring conjecture. No resolution is supplied here.
Sources & referencesView supporting material
Primary source
Giuseppe Mazzuoccolo and Vahan Mkrtchyan, “Normal 6-edge-colorings of some bridgeless cubic graphs”, arXiv:1903.06043 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.