On the size of a blocking set in PG(2,p)

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We show that the size of a non-trivial blocking set in the Desarguesian projective planePG(2,p), wherep is prime, is at least 3(p+1)/2. This settles a 25 year old conjecture of J. di Paola.
Original languageEnglish
Pages (from-to)111-114
JournalCombinatorica
Volume14
Issue number1
DOIs
Publication statusPublished - 1994

Fingerprint Dive into the research topics of 'On the size of a blocking set in PG(2,p)'. Together they form a unique fingerprint.

  • Cite this