| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656016 | Journal of Combinatorial Theory, Series A | 2011 | 5 Pages |
Abstract
In this paper we prove a conjecture of Metsch about the maximum number of lines intersecting a pointset in PG(2,q), presented at the conference “Combinatorics 2002”. As a consequence, we give a short proof of the famous Jamison, Brouwer and Schrijver bound on the size of the smallest affine blocking set in AG(2,q).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
