DOIAbstract
AbstractIt is proved that the minimum cardinality of a subset of AG(k, q) which intersects all hyperplanes is k(q − 1) + 1. In case k = 2 this settles a conjecture of J. Doyen
AbstractIt is proved that the minimum cardinality of a subset of AG(k, q) which intersects all hyperplanes is k(q − 1) + 1. In case k = 2 this settles a conjecture of J. Doyen
AbstractBruen proved that if A is a set of points in AG(n,q) which intersects every hyperplane in at...
AbstractWe obtain lower bounds for the size of a double blocking set in the Desarguesian projective ...
AbstractA family of mutually intersecting k-sets is called a k-clique. A k-clique is maximal if it i...
AbstractIt is proved that the minimum cardinality of a subset of AG(k, q) which intersects all hyper...
A blocking set in an affine plane is a set of points B such that every line contains at least one po...
A blocking set in an affine plane is a set of points B such that every line contains at least one po...
A blocking set in an affine plane is a set of points B such that every line contains at least one poin...
ACM Computing Classification System (1998): G.2.1.We prove that the minimum size of an affine blocki...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
S Affine blocking sets or intersection sets Simeon Ball Faculty of Discrete Mathematics Technica...
AbstractWe show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyp...
AbstractIn this paper, we show that a set of q+a hyperplanes, q>13, a≤(q−10)/4, that does not cover ...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
AbstractIn this paper we prove a conjecture of Metsch about the maximum number of lines intersecting...
AbstractWe prove that a small minimal blocking set of PG(2,q) is “very close” to be a linear blockin...
AbstractBruen proved that if A is a set of points in AG(n,q) which intersects every hyperplane in at...
AbstractWe obtain lower bounds for the size of a double blocking set in the Desarguesian projective ...
AbstractA family of mutually intersecting k-sets is called a k-clique. A k-clique is maximal if it i...
AbstractIt is proved that the minimum cardinality of a subset of AG(k, q) which intersects all hyper...
A blocking set in an affine plane is a set of points B such that every line contains at least one po...
A blocking set in an affine plane is a set of points B such that every line contains at least one po...
A blocking set in an affine plane is a set of points B such that every line contains at least one poin...
ACM Computing Classification System (1998): G.2.1.We prove that the minimum size of an affine blocki...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
S Affine blocking sets or intersection sets Simeon Ball Faculty of Discrete Mathematics Technica...
AbstractWe show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyp...
AbstractIn this paper, we show that a set of q+a hyperplanes, q>13, a≤(q−10)/4, that does not cover ...
AbstractIn this paper we show that blocking sets of cardinality less than 3(q+ 1)/2 (q=pn) in Desarg...
AbstractIn this paper we prove a conjecture of Metsch about the maximum number of lines intersecting...
AbstractWe prove that a small minimal blocking set of PG(2,q) is “very close” to be a linear blockin...
AbstractBruen proved that if A is a set of points in AG(n,q) which intersects every hyperplane in at...
AbstractWe obtain lower bounds for the size of a double blocking set in the Desarguesian projective ...
AbstractA family of mutually intersecting k-sets is called a k-clique. A k-clique is maximal if it i...
Add to ORKG