We study minimal blocking sets in PG(2,q) having q + m points outside some fixed line. If 0<m<(√q)/2 then either the blocking set is large, or every line contains 1 mod p points of the blocking set, where p is the characteristic of the field GF(q).
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics