Abstract
We show that a maximal partial spread inPG(3,q) is either a spread or has at most\(q^2 + 1 - \sqrt {2q} \) lines. This implies that it is not possible to cover all points but the points of a Baer-subspace by lines.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blokhuis, A. and Brouwer, A.E. 1986. Blocking sets in desarguesian projective planes.Bull. London Math. Soc. 18:132–134.
Blokhuis, A., Brouwer, A.E. and Wilbrink, H. A. 1989. Heden's bound on maximal partial spreads.Discrete Mathematics. 74:335–339.
Blokhuis, A., Brouwer, A.E. and Szőnyi, T. 1992. The number of directions determined by a functionf on a finite field. Manuscript.
Bruen, A.A. 1971. Partial spreads and replaceable nets.Canad. J. Math. 23:381–391.
Bruen, A.A. and Silverman, R. 1987. Arcs and blocking sets II.Europ. J. Combinatorics. 8:351–356.
van Dam, E. 1993. Classification of spreads inPG(3, 4) ∖PG(3, 2).Designs, Codes and Cryptography, 3:193–198.
Heden, O. 1986. Maximal partial spreads and two-weight codes.Discrete Math. 62:277–293.
Hirschfeld, J.W.P. 1985.Finite Projective Spaces of Three Dimensions. Oxford Mathematical Monographs. Oxford University Press, Oxford.
Mesner, D.M. 1967. Sets of disjoint lines inPG(3,q).Canad. J. Math. 19:273–280.
Metsch, K. 1991. Improvement of Bruck's completion theorem.Designs, Codes and Cryptography. 1(2):99–116.
Author information
Authors and Affiliations
Additional information
Communicated by D. Jungnickel
Rights and permissions
About this article
Cite this article
Blokhuis, A., Metsch, K. On the size of a maximal partial spread. Des Codes Crypt 3, 187–191 (1993). https://doi.org/10.1007/BF01388479
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388479