The NP-completeness of 2-SPANNING-CIRCUIT for binary matroids
Statement
A binary matroid is a matroid representable over the two-element field. The 2-SPANNING-CIRCUIT problem asks whether a matroid has a circuit containing two specified elements. 2-SPANNING-CIRCUIT conjecture. 2-SPANNING-CIRCUIT is NP-complete for binary matroids. The source explains that this conjecture, together with a reduction from 2-SPANNING-CIRCUIT to the complement of , would imply the binary-matroid part of the EqualitySY coNP-completeness conjecture; the complexity of 2-SPANNING-CIRCUIT for binary matroids 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.