Rainbow and monochromatic circuits and cocircuits in binary matroids (Q2124622): Difference between revisions

Given a matroid with a coloring of its ground set, this coloring is called rainbow circuit-free provided any circuit contains two elements of the same color. The authors concentrate on binary matroids in the paper under review. Motivated by previous work [\textit{K. Bérczi} et al., SIAM J. Discrete Math. 35, No. 3, 2192--2209 (2021; Zbl 1491.05044)], the authors investigate reductions from an arbitrary matroid to a partition matroid and show that these reductions correspond to rainbow circuit-free colorings.