The critical-snark Fulkerson-cover conjecture
Statement
Let be a critical snark, let a hexagon be a -cycle, and let a hexagon be double-core when it is a double-core hexagon for a -array of perfect matchings. An optimal -array is a -array leaving the minimum possible number of uncovered edges. Critical-snark Fulkerson-cover conjecture. Every hexagon in is double-core. In particular, every optimal -array of perfect matchings extends to a Fulkerson cover. The claim is motivated by the fact that a double-core hexagon yields a Fulkerson cover; its general validity is left 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.