New lower bounds are given for the size of a point set in a Desarguesian projective plane over a finite field that contains at least a prescribed number s of points on every line. These bounds are best possible when q is square and s is small compared with q. In this case the smallest set is shown to be the union of disjoint Baer subplanes. The results are based on new results on the structure of certain lacunary polynomials, which can be regarded as a generalization of Rédei's results in the case when the derivative of the polynomial vanishes
We describe small dominating sets of the incidence graphs of finite projective planes by establishin...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
This paper examines subsets with at most n points on a line in the projective plane π q = PG(2, q). ...
New lower bounds are given for the size of a point set in a Desarguesian projective plane over a fin...
We obtain lower bounds for the size of a double blocking set in the Desarguesian projective planePG(...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
We survey recent results concerning the size of blocking sets in desarguesian projective and affine ...
ing sets, that is blocking sets not containing a proper subset that is still a blocking set. The sma...
AbstractWe obtain lower bounds for the size of a double blocking set in the Desarguesian projective ...
Using theorems of Redéi, and of Brouwer and Schrijver, and Jamison, it is proved that a non-trivial ...
In this paper, by using properties of Baer subplanes, we describe the construction of a minimal bloc...
AbstractWe prove that in the desarguesian plane PG(2, qt) (t>4) there are at least three inequivalen...
AbstractLower bounds are obtained for the size of a triple blocking set in the Desarguesian projecti...
We describe small dominating sets of the incidence graphs of finite projective planes by establishin...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
This paper examines subsets with at most n points on a line in the projective plane π q = PG(2, q). ...
New lower bounds are given for the size of a point set in a Desarguesian projective plane over a fin...
We obtain lower bounds for the size of a double blocking set in the Desarguesian projective planePG(...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
We survey recent results concerning the size of blocking sets in desarguesian projective and affine ...
ing sets, that is blocking sets not containing a proper subset that is still a blocking set. The sma...
AbstractWe obtain lower bounds for the size of a double blocking set in the Desarguesian projective ...
Using theorems of Redéi, and of Brouwer and Schrijver, and Jamison, it is proved that a non-trivial ...
In this paper, by using properties of Baer subplanes, we describe the construction of a minimal bloc...
AbstractWe prove that in the desarguesian plane PG(2, qt) (t>4) there are at least three inequivalen...
AbstractLower bounds are obtained for the size of a triple blocking set in the Desarguesian projecti...
We describe small dominating sets of the incidence graphs of finite projective planes by establishin...
Lower bounds are given for the number of lines blocked by a set of q + 2 points in a projective plan...
This paper examines subsets with at most n points on a line in the projective plane π q = PG(2, q). ...