Coloring matroids

AbstractConsider a simple matroid M(E) with rank r = 3. We prove that there is no partition + ⋃ such that, for every line l of M, at least one of the sets l∩E1 or l∩E2 is a singleton. A natural generalization of this result to higher ranks is considered