ISSN:
1572-9168
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A (k, d)-arc in PG(2, q) is a set of k points such that some d, but no d+1, of them are collinear. An outstanding problem is to find the maximum value of k for which a (k, d)-arc exists. A construction is given for a class of (k, p n−p m)-arcs in PG(2, p n). These arcs constitute a lower bound on the maximum possible value of k, and a subset of them is shown to be optimal.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00211704