Máčajová–Škoviera odd-cut conjecture for bridgeless cubic graphs
Statement
Let be a bridgeless cubic graph. A perfect matching is a set of edges meeting every vertex exactly once, and an edge-cut is the set of edges joining a vertex subset to its complement. Máčajová–Škoviera conjecture. Every bridgeless cubic graph has two perfect matchings such that their intersection does not contain an edge-cut of odd cardinality. This is one of the weaker statements implied by the Berge–Fulkerson conjecture and is stated in the source as having been proved by Kardoš, Máčajová and Zerafa.
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.