Largest minimal blocking sets in PG(2,8)

DOI10.1002/jcd.10035zbMath1028.51010OpenAlexW2033913132MaRDI QIDQ4808409

János Barát, Stefano Innamorati

Publication date: 22 May 2003

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10035

zbMATH Keywords

projective planeFano planeminimal blocking set

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Blocking sets, ovals, (k)-arcs (51E21)

Related Items (1)

On large minimal blocking sets in PG(2,q)

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning the complement of a simplex in \(PG(e,q^{d+1})\) into copies of PG(d,q)
• Minimal blocking sets in \(PG(2,8)\) and maximal partial spreads in \(PG(3,8)\)
• Multiple Blocking Sets and Arcs in Finite Planes

This page was built for publication: Largest minimal blocking sets in PG(2,8)