Abstract
We investigate sets of lines inPG(2s,q) such that everys-dimensional subspace contains a line of this set. We determine the minimum number of lines in such a set and show that there is only one type of such a set with this minimum number of lines.
Similar content being viewed by others
References
A. Beutelspacher, andJ. Ueberberg: A characteristic property of geometrict-spreads in finite projective spaces,Europ. J. Comb.,12 (1991), 277–281.
R. C. Bose, andR. C. Burton: A characterization of Flat Spaces in a Finite Geometry and the uniqueness of the Hamming and the MacDonald Codes,J. Comb. Th.,1 (1966), 96–104.
A. Brouwer: Personal communication.
F. Buekenhout, andP. Cameron: Projective and affine geometry over division rings, in:Handbook of Incidence Geometry edited by F. Buekenhout, Elsevier Science B. V., 1995.
J. Kahn, andG. Kalai: A problem of Füredi and Seymour on Covering Intersecting Families of Graphs,J. Comb. Th. (A),68 (1994), 317–339.