Fair Representation in the Intersection of Two Matroids

Mysteriously, hypergraphs that are the intersection of two matroids behave in some respects almost as well as one matroid. In the present paper we study one such phenomenon the surprising ability of the intersection of two matroids to fairly represent the parts of a given partition of the ground set. For a simplicial complex C denote by β(C) the minimal number of edges from C needed to cover the ground set. If C is a matroid then for every partition A1, . . . , Am of the ground set there exists a set S ∈ C meeting each Ai in at least b |Ai| β(C)c elements. We conjecture that a slightly weaker result is true for the intersection of two matroids: if D = P ∩Q, where P,Q are matroids on the same ground set V and β(P), β(Q) 6 k, then for every partition A1, . . . , Am of the ground set there exists a set S ∈ D meeting each Ai in at least 1 k |Ai| − 1 elements. We prove that if m = 2 (meaning that the partition is into two sets) there is a set belonging to D meeting each Ai in at least ( 1 k − 1 |V |)|Ai| − 1 elements.