A new upper bound for the largest complete (k,n)-arc in PG(2,q)

From MaRDI portal
Publication:5043425















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)