The classification of the smallest nontrivial blocking sets in PG(n,2)

DOI10.1016/J.JCTA.2005.11.002zbMATH Open1117.51011OpenAlexW1998187090MaRDI QIDQ855848FDOQ855848

Authors: Patrick Govaerts, Leo Storme 

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.11.002

Recommendations

• Blocking sets in \(\mathrm{PG}(r,q^n)\)
• scientific article; zbMATH DE number 1594306
• Blocking Sets in Desarguesian Projective Planes
• scientific article; zbMATH DE number 872500
• Small point sets of \(\text{PG}(n, q ^{3})\) intersecting each \(k\)-subspace in 1 mod \(q\) points
• On multiple blocking sets in Galois planes
• scientific article; zbMATH DE number 4100052
• Lower bounds for the cardinality of minimal blocking sets in projective spaces
• scientific article; zbMATH DE number 878888
• On the size of a blocking set in \(\text{PG}(2,p)\)

zbMATH Keywords

blocking setsGalois spaces

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• Small minimal blocking sets and complete \(k\)-arcs in PG\((2,p^3)\)
• Title not available (Why is that?)
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• Blocking sets and partial spreads in finite projective spaces
• On the size of a blocking set in \(\text{PG}(2,p)\)
• Baer subplanes and blocking sets
• Small blocking sets in \(PG(2,p^3)\)
• On small blocking sets and their linearity
• Title not available (Why is that?)
• Small minimal blocking sets in \(\text{PG}(2,q^3)\)

Cited In (11)

• Title not available (Why is that?)
• A geometric version of the Andrásfai-Erdős-Sós theorem
• On the non-trivial minimal blocking sets in binary projective spaces
• Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups
• Stability and exact Turán numbers for matroids
• Open problems in finite projective spaces
• Constructing minimal blocking sets using field reduction
• The characterisation of the smallest two fold blocking sets in PG\((n, 2)\)
• Classification theorem for strong triangle blocking arrangements
• Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\)
• The use of blocking sets in Galois geometries and in related research areas

This page was built for publication: The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855848)