On the size of the smallest non-classical blocking set of Rédei type in \(PG (2, p)\)

DOI10.1006/JCTA.1999.2998zbMath0955.51006OpenAlexW2024664845MaRDI QIDQ1971012

András Gács

Publication date: 27 February 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.2998

zbMATH Keywords

blocking setRédei type

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• On the number of slopes of the graph of a function defined on a finite field
• On the size of a blocking set in \(\text{PG}(2,p)\)
• The number of directions determined by a function \(f\) on a finite field
• Unnamed Item
• Unnamed Item

This page was built for publication: On the size of the smallest non-classical blocking set of Rédei type in \(PG (2, p)\)