A new upper bound for the largest complete (k,n)-arc in PG(2,q)
From MaRDI portal
Publication:5043425
Recommendations
Cites work
- Baer subplanes and blocking sets
- Blocking Sets in Finite Projective Planes
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 3728279 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- Multiple Blocking Sets and Arcs in Finite Planes
- On Minimum Blocking Coalitions in Small Projective Plane Games
- On the size of a triple blocking set in \(\text{PG} (2,q)\)
Cited in
(8)- Arcs, blocking sets, and minihypers
- A new lower bound for the smallest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)
- Bounds for arcs of arbitrary degree in finite Desarguesian planes
- scientific article; zbMATH DE number 3842616 (Why is no real title available?)
- A note on (k, n)-arcs
- On sizes of complete arcs in \(PG(2,q)\)
- Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
- Infinite family of large complete arcs in PG\((2, q ^{n })\), with \(q\) odd and \(n > 1\) odd
This page was built for publication: A new upper bound for the largest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043425)