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

DOI10.1006/JCTA.1999.2998MaRDI QIDQ1971012zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Directions in AG(2,p^2).
• Blocking sets of almost Rédei type
• Blocking sets in Desarguesian affine and projective planes

Cites work

• scientific article; zbMATH DE number 3849971 (Why is no real title available?)
• scientific article; zbMATH DE number 3501652 (Why is no real title available?)
• 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

Cited in

(10)

• Directions in AG(2,p^2).
• On the number of slopes of the graph of a function defined on a finite field
• Blocking sets of almost Rédei type
• A remark on blocking sets of almost Rédei type
• Rédei blocking sets in finite Desarguesian planes
• Around Rédei's theorem
• On a generalization of Rédei's theorem
• Minimal blocking sets of size \(2p-2\) and \(2p-3\) in \(PG(2, p)\), \(p\) prime and \(p > 5\)
• Nearfield planes and the direction problem in \(\mathrm{AG}(2,q^2)\)
• Some generalizations of Rédei’s theorem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971012)