The Minimal Blocking Set Of Size 22 In PG ( 2 , 13 )

Section: Research Paper
Published
Jun 3, 2010
Pages
77-88

Abstract

A blocking set B in projective plane PG (2, ) in a set of points such that every line in the plane intersect B in at least one point and there exist a line intersect B in only one point, we say that B is minimal if B has no minimal blocking subset. In this project we proved the non-existence of minimal blocking set of size 22 contains 8-secant and not contains 9-secant in PG (2, 13). Also we have proved the existence of minimal blocking set of the size 22 of redei-type. Also we give some properties of such blocking set.

Download this PDF file

Statistics

How to Cite

H. Kadoo, F. (2010). The Minimal Blocking Set Of Size 22 In PG ( 2 , 13 ). AL-Rafidain Journal of Computer Sciences and Mathematics, 7(2), 77–88. https://doi.org/10.33899/csmj.2010.163898
Copyright and Licensing