Mazzuoccolo's bipartite-complement conjecture for cubic graphs
Statement
Let be a bridgeless cubic graph. Mazzuoccolo's conjecture. There exist two perfect matchings such that the graph obtained by deleting their union, , is bipartite. The source presents this as a weakening of the preceding perfect-matching conjectures; no resolution is supplied here.
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.