The Minimal Blocking Set Of Size 22 In PG ( 2 , 13 )
Section: Research Paper
Pages
77-88Keywords:
Blocking Sets - ( k,
n ) – arcs,
fundamental theorem of projective geometry
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.
References
Identifiers
Download this PDF file
Statistics
How to Cite
The Minimal Blocking Set Of Size 22 In PG ( 2 , 13 ). (2010). AL-Rafidain Journal of Computer Sciences and Mathematics, 7(2), 77-88. https://doi.org/10.33899/csmj.2010.163898
Copyright and Licensing

This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
The Minimal Blocking Set Of Size 22 In PG ( 2 , 13 ). (2010). AL-Rafidain Journal of Computer Sciences and Mathematics, 7(2), 77-88. https://doi.org/10.33899/csmj.2010.163898





