On the minimum number of points covered by a set of lines in \(\mathrm{PG}(2,q)\)

DOI10.1007/s10623-013-9851-2zbMath1306.05022OpenAlexW1238762586MaRDI QIDQ488252

Seon Jeong Kim, Eun Ju Cheon

Publication date: 23 January 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-013-9851-2

zbMATH Keywords

arcrational pointprojective planehyperovalconiclargest arc

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Rational points (14G05) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• On the stability of sets of even type
• Le geometrie di Galois
• The minimal number of lines intersected by a set of \(q+2\) points, blocking sets, and intersecting circles
• Bounds on \((n,r)\)-arcs and their application to linear codes
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimum number of points covered by a set of lines in \(\mathrm{PG}(2,q)\)