We investigate sets of lines in PG(2s, q) such that every s-dimensiona
l subspace contains a line of this set. We determine the minimum numbe
r of lines in such a set and show that there is only orle type of such
a set with this minimum number of lines.