A new lower bound for the size of an affine blocking set (2018)
AuthorsDe Boeck M, Van de Voorde Gshow all
A blocking set in an aﬃne plane is a set of points B such that every line contains at least one point of B. The best known lower bound for blocking sets in nondesarguesian aﬃne planes was derived in the 1980’s by Bruen and Silverman. In this note, we improve on this result by showing that a blocking set of an aﬃne plane of order q, q > 25, contains at least q +b√qc+ 3 points.
CitationDe Boeck M, Van de Voorde G (2018). A new lower bound for the size of an affine blocking set. The Electronic Journal of Combinatorics. 25(4).
This citation is automatically generated and may be unreliable. Use as a guide only.