The dihedral 2-flow conjecture for 3-edge-colorable cubic graphs
Statement
Let be a -edge-colorable cubic graph. An embedding of in a surface is an embedding whose genus is the genus of , and a nowhere-identity dihedral -flow is a flow with values in the dihedral group of order such that no edge receives the identity element. Dihedral 2-flow conjecture. For every -edge-colorable cubic graph, there exists an embedding in a surface of its own genus, with respect to which it has a nowhere-identity dihedral -flow. Confirmation would imply a positive answer to whether every planar cubic graph has a nowhere-identity dihedral -flow; the source gives no resolution of this conjecture.
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.