The converse Bernstein-coloring conjecture for independence in
Let be a bipartite graph, let be an integer, and let denote the matroid introduced in the paper. A -coloring of the edges of is -Bernstein if it has no monochromatic cycles and there is a labeling , with , such that
for every , and, for every edge with color ,
for every . The converse Bernstein-coloring conjecture. If is independent in , then admits a -coloring that is -Bernstein. This is presented as the converse to the preceding proposition, which proves that a -Bernstein coloring implies independence in the relevant dual matroid; the supplied text gives no resolution status or further evidence, so the conjecture remains open.
References
- Joshua Brakensiek, Manik Dhar, Jiyang Gao, Sivakanth Gopi and Matt Larson, “Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes”, arXiv:2405.00778 (2026).
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
No solutions have been posted yet.