Fan–Raspaud conjecture for bridgeless cubic graphs
Statement
Let be a bridgeless cubic graph. Fan–Raspaud conjecture. The graph contains three perfect matchings such that no edge is covered by all three of them. The Berge–Fulkerson conjecture implies this conjecture, but the Fan–Raspaud conjecture remains open, including in the finite setting discussed in the source.
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.