Covering points with planes

Abstract: Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound on $|S|$, which is tight in some cases, for example when all of the planes have the same dimension. We produce an example showing that this upper bound does not hold for point sets whose proper subsets are covered by lines in $(\mathbb{Z}/p<sup>k\mathbb{Z})<sup>2$ with $k\geq 2$, and prove an upper bound in this case. We also investigate the analogous problem for general matroids.