Fulkerson's six-perfect-matching conjecture for bridgeless cubic graphs
Statement
Let be a bridgeless cubic graph. A Fulkerson cover is a list of six perfect matchings of in which every edge is contained in exactly two matchings. Fulkerson's conjecture. Every bridgeless cubic graph admits a Fulkerson cover. This conjecture is also widely known as the Berge--Fulkerson Conjecture and remains open.
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.