Small minimal blocking sets and complete k-arcs in PG(2,p3) Original Research Article

In this paper we improve the upper bound of the size of a small minimal blocking set in PG(2,q) and we show that a small minimal blocking set B in PG(2,p3) is either of Rédei type or every line intersects B in ‘few points’. Finally, using this result we prove that a complete k-arc in PG(2,p3) has more than 3p3+1/2 points for every prime p.