论文信息 - A stability theorem for lines in Galois planes of prime order - 字舞流文

A stability theorem for lines in Galois planes of prime order

In this paper we prove that a point set of size less than $${\frac{3}{2}(q+1)}$$ in PG(2, q), q prime, that has relatively few 0-secants must contain many collinear points. More precise bounds can be found in Theorem 4.

Tamás Szonyi | Zsuzsa Weiner

[1] A. Bruen,et al. Baer subplanes and blocking sets , 1970 .

[2] Tamás Szőnyi,et al. On the spectrum of minimal blocking sets in PG$(2,q)$ , 2003 .

[3] Alexander Schrijver,et al. The Blocking Number of an Affine Space , 1978, J. Comb. Theory, Ser. A.

[4] A. Blokhuis,et al. Covering all points except one , 2010 .

[5] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[6] Andries E. Brouwer,et al. Blocking sets in desarguesian projective planes , 1986 .

[7] Tamás Szonyi. Around Rédei's theorem , 1999, Discret. Math..

[8] Aart Blokhuis,et al. On the size of a blocking set inPG(2,p) , 1994, Comb..

[9] A. Bruen. Blocking Sets in Finite Projective Planes , 1971 .

[10] Dennis Saleh. Zs , 2001 .

[11] ROBERT E. JAMISON,et al. Covering Finite Fields with Cosets of Subspaces , 1977, J. Comb. Theory, Ser. A.

[12] Antonio Maturo,et al. The spectrum of minimal blocking sets , 1999, Discret. Math..