arXiv Analytics

Sign in

arXiv:1201.2260 [math.CO]AbstractReferencesReviewsResources

The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)

Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco

Published 2012-01-11Version 1

In this work we solve the packing problem for complete (n,3)-arcs in PG(2,16), determining that the maximum size is 28 and the minimum size is 15. We also performed a partial classification of the extremal size of complete (n,3)-arcs in PG(2,16).

Comments: 3 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2301.13001 [math.CO] (Published 2023-01-30)
On the minimum size of linear sets
arXiv:math/9409213 [math.CO] (Published 1994-09-16)
Inverting sets and the packing problem
arXiv:1707.07288 [math.CO] (Published 2017-07-23)
Minimum size of n-factor-critical graphs and k-extendable graphs

Links

Toolbox