The conjecture on reducing matroids to partition matroids
Let be a -colorable matroid, meaning that its ground set can be partitioned into independent sets. A reduction to a partition matroid is a partition matroid on the same ground set whose independent sets are also independent in . Reduction conjecture. Every -colorable matroid can be reduced to a -colorable partition matroid. The paper presents this as a conjectural extension of its reductions for several classes, including gammoids; the general case is not established in the supplied text.
References
Primary source
Kristóf Bérczi, Tamás Schwarcz and Yutaro Yamaguchi, “List colouring of two matroids through reduction to partition matroids”, arXiv:1911.10485 (2020).
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.