ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a critical snark, let a hexagon be a 66-cycle, and let a hexagon be double-core when it is a double-core hexagon for a 33-array of perfect matchings. An optimal 33-array is a 33-array leaving the minimum possible number of uncovered edges. Critical-snark Fulkerson-cover conjecture. Every hexagon in GG is double-core. In particular, every optimal 33-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.