Journal of combinatorial theory. Series A, 2011-10, Vol.118 (7), p.2066-2070
2011
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Proof of a conjecture of Metsch
- Ist Teil von
- Journal of combinatorial theory. Series A, 2011-10, Vol.118 (7), p.2066-2070
- Ort / Verlag
- Elsevier Inc
- Erscheinungsjahr
- 2011
- Quelle
- Alma/SFX Local Collection
- Beschreibungen/Notizen
- 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 ) .
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0097-3165eISSN: 1096-0899DOI: 10.1016/j.jcta.2011.04.012Titel-ID: cdi_crossref_primary_10_1016_j_jcta_2011_04_012
- Format
- –
- Schlagworte
- Blocking sets, Finite geometry, Galois planes