Weak oddness versus resistance conjecture
Let be a bridgeless cubic graph. Let denote its weak oddness and its resistance, using the definitions in the paper.
Weak oddness versus resistance conjecture. One has
This conjecture compares two structural measures of edge-uncolorability. The paper presents it as one of two conjectural inequalities and gives no resolution.
References
Primary source
M. A. Fiol, G. Mazzuoccolo and E. Steffen, “On measures of edge-uncolorability of cubic graphs: A brief survey and some new results”, arXiv:1702.07156 (2017).
Additional references
2 papers in this index state this conjecture (2016–2017). The statement above is taken from the most recent of them; the others are arXiv:1601.05762.
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
No solutions have been posted yet.