Abstract
Assuming a partial spread of Full-size image (<1 K) or Full-size image (<1 K), with deficiency δ, is maximal and using results on minihypers, which are closely related to blocking sets in PG(2,q), we obtain lower bounds for δ. If q is even, using extendability of arcs in PG(2,q), we prove that a maximal partial spread of Full-size image (<1 K) which does not cover (∞) does not exist if δ≤q−1. This improves a theorem of Tallini (Proceedings of the First International Conference on Blocking Sets (Giessen, 1989) 201 (1991) 141) for Full-size image (<1 K), and, furthermore, this result is sharp since partial spreads with deficiency δ=q are constructed.
Original language | English |
---|---|
Pages (from-to) | 73-84 |
Journal | European Journal of Combinatorics |
Volume | 24 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2003 |