Lower bounds on blocking sets

DOI10.2140/PJM.1985.118.303MaRDI QIDQ1062012zbMATH OpenOpenAlexWikidataFDO

Authors Aiden A. Bruen, Bruce Rothschild

Publication date 1985

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.pjm/1102706440

zbMATH Keywords

blocking setsinversive planeprojective m-spaceprojective planesspread

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Combinatorial structures in finite projective spaces (51E20)

Review text

The author obtains lower bounds for the number of elements in blocking sets in inversive and projective planes. He extends the notion of blocking sets to families of disjoint subspaces and obtains a lower bound for the number of elements in a maximal partial spread of m-spaces in projective \((2m+1)\)-space.

Recommendations

• Lower bounds for the cardinality of minimal blocking sets in projective spaces
• scientific article; zbMATH DE number 4080277
• Blocking sets in block designs
• A new lower bound for the size of an affine blocking set
• Blocking sets in projective spaces

Cited in

(7)

• Random constructions and density results
• Blocker size via matching minors
• Matchings and covers in hypergraphs
• On the cardinality of intersection sets in inversive planes
• scientific article; zbMATH DE number 24825 (Why is no real title available?)
• On the metric dimension of incidence graphs of Möbius planes
• On blocking sets of inversive planes

This page was built for publication: Lower bounds on blocking sets

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