Cocircuit-rank conjecture for non-graphic binary matroids
Cocircuit-rank conjecture for non-graphic binary matroids
Let be a -connected non-graphic binary matroid. Define to be the set of elements of avoiding more than non-separating cocircuits, and let . Here denotes the rank function of the dual matroid.
Cocircuit-rank conjecture. One has
This conjecture generalizes the paper's principal theorem, which proves stronger conclusions for non-regular matroids and for regular matroids under specified minor hypotheses. The paper reports a theoretical reduction but says that the computational verification remains to be completed.
Sources & referencesView supporting material
Primary source
João Paulo Costalonga, “Non-Separating Cocircuits and Graphicness in Matroids”, arXiv:1211.5823 (2012).
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.