|
|||||
|
|
Proof of a conjecture of Metsch |
|
| Authors: | Tamá s Sz?nyi,Zsuzsa Weiner |
| Affiliation: | a Department of Computer Science, Eötvös Loránd University, H-1117 Budapest, Pázmány Péter sétány 1/C, Hungary b Computer and Automation Research Institute of the Hungarian Academy of Sciences, H-1111 Budapest, Lágymányosi út 11, Hungary c Prezi.com, H-1075 Budapest, Károly krt. 9, Hungary |
| 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). |
| Keywords: | Finite geometry Galois planes Blocking sets |
| 本文献已被 ScienceDirect 等数据库收录！ | |