Maximal \((n,3)\)-arcs in PG(2,11)
type: Item
instance of: scholarly article
title: Maximal \((n,3)\)-arcs in PG(2,11)
zbMATH Open document ID: 0939.51017
DOI: 10.1016/S0012-365X(99)00202-2
author: Stefano Marcugini
author: Alfredo Milani
author: Fernanda Pambianco
published in: Discrete Mathematics
publication date: 1999-11-25T00:00:00Z
review text: In a projective plane an \((n,r)\)-arc is a set of \(n\) points, no \((n+1)\) of which are collinear. This generalizes the idea of an \(n\)-arc -- a set of \(n\) points, no three of which are collinear. An \((n,r)\)-arc is complete if it is not included in an \((n+1,r)\)-arc. By a computer based search exploiting the fact that an \((n,3)\)-arc with \(n\geq 21\) contains an arc of size 7, the authors show that the largest size of an \((n,3)\)-arc in \(PG(2,11)\) is 21.
Mathematics Subject Classification ID: 51E21
zbMATH DE Number: 1369796
zbMATH Keywords: \((n,3)\)-arc
reviewed by: Theodore G. Ostrom
MaRDI profile type: Publication
Wikidata QID: Q127125080
description: scientific article; zbMATH DE number 1369796