Coloring, list coloring, and fractional coloring in intersections of matroids

Abstract It is known that in matroids the difference between the chromatic number and the fractional chromatic number is smaller than 1, and that the list chromatic number is equal to the chromatic number. We investigate the gap within these pairs of parameters for hypergraphs that are the intersection of a given number k of matroids. We prove that in such hypergraphs the list chromatic number is at most k times the chromatic number and at most $$2k-1$$ 2 k - 1 times the maximum chromatic number among the  k matroids. We study the relationship between three polytopes associated with k -sets of matroids, and connect them to bounds on the fractional chromatic number of the intersection of the members of the k -set. This also connects to bounds on the matroidal matching and covering number of the intersection of the members of the k -set. The tools used are in part topological.