New lower bounds on the size of (n,r)-arcs in PG(2,q)

Michael Braun

An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective lin…