On the number of pairwise non-isomorphic minimal blocking sets in PG(2,q)
From MaRDI portal
Publication:1009182
DOI10.1007/S10623-007-9118-XzbMATH Open1404.51009OpenAlexW2003519002MaRDI QIDQ1009182FDOQ1009182
Authors: Csaba Mengyán
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9118-x
Recommendations
Cites Work
- Title not available (Why is that?)
- Baer subplanes and blocking sets
- Matchings and covers in hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the spectrum of non-Denniston maximal arcs in PG(2, 2\(^{h}\)).
- New maximal arcs in Desarguesian planes
- Blocking sets
- Note on the existence of large minimal blocking sets in Galois planes
- On large minimal blocking sets in PG(2,q)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- A computer search for minimal blocking sets in \(PG(2,q)\).
- Random constructions and density results
- On the spectrum of minimal blocking sets in \(\text{PG}(2,q)\)
- Classification of minimal blocking sets in PG(2,9)
- Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups
- Arcs and blocking sets. II
This page was built for publication: On the number of pairwise non-isomorphic minimal blocking sets in \(\mathrm{PG}(2,q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009182)