Degree-five characterization conjecture for simple or cosimple connected binary matroids
Degree-five characterization conjecture for simple or cosimple connected binary matroids
Let be a connected binary matroid that is simple or cosimple. The statements (a), (b), and (c) in the degree-five lemma are equivalent. Degree-five characterization conjecture.
The lemma gives only the implications from (a) to (b) to (c) for binary matroids, so this conjecture proposes equivalence for connected matroids that are simple or cosimple. An explicit characterization of matroids with the relevant invariant satisfying is presented as an alternative motivating problem, and the conjectured equivalence remains open in the supplied text.
Sources & referencesView supporting material
Primary source
Tim Römer and Sara Saeedi Madani, “Cycle algebras and polytopes of matroids”, arXiv:2105.00185 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.