The blocking number of an affine space
From MaRDI portal
Publication:1244233
DOI10.1016/0097-3165(78)90013-4zbMath0373.05020OpenAlexW2135384757WikidataQ60306531 ScholiaQ60306531MaRDI QIDQ1244233
Andries E. Brouwer, Alexander Schrijver
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/7438
Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial aspects of packing and covering (05B40)
Related Items
On nuclei and affine blocking sets, Blocking and double blocking sets in finite planes, More on maximal intersecting families of finite sets, A new lower bound for the size of an affine blocking set, Covering symmetric sets of the Boolean cube by affine hyperplanes, Multiple blocking sets and multisets in Desarguesian planes, Applications of finite fields to combinatorics and finite geometries, Book review of: L. Guth, Polynomial methods in combinatorics, Coverings of Abelian groups and vector spaces., Heden's bound on maximal partial spreads, A note on intersecting hypergraphs with large cover number, Minimal Symmetric Differences of Lines in Projective Planes, On the stability of small blocking sets, Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\), On \(q\)-analogues and stability theorems, Punctured combinatorial Nullstellensätze, Unique reducibility of multiple blocking sets, Some self-blocking block designs, A general construction for blocking sets in finite affine geometries, On almost \(k\)-covers of hypercubes, Weighted arcs, the finite Radon transform and a Ramsey problem, A stability theorem for lines in Galois planes of prime order, On Zeros of a Polynomial in a Finite Grid, Lower bounds on Tuza constants for transversals in linear uniform hypergraphs, Relative blocking sets of unions of Baer subplanes, Polynomial multiplicities over finite fields and intersection sets, Covers in partitioned intersecting hypergraphs, Small transversals in hypergraphs, On the Alon-Füredi bound, On bisecants of Rédei type blocking sets and applications, The Sperner capacity of linear and nonlinear codes for the cyclic triangle, A \(p\)-adic condition on the weight of a codeword of a linear code, On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces, Proof of a conjecture of Metsch, Uncertainty in finite planes, On Turan hypergraphs, Covering all points except one, Constructing Minimal Blocking Sets Using Field Reduction, Blocking sets in Desarguesian affine and projective planes, Matchings and covers in hypergraphs, A nowhere-zero point in linear mappings, On the metric dimension of affine planes, biaffine planes and generalized quadrangles, On intersection sets in Desarguesian affine spaces, On nuclei and blocking sets in Desarguesian spaces, On generalized Ramsey numbers for trees, Local constraints ensuring small representing sets, Small blocking sets of Hermitian designs, On the size of a blocking set in \(\text{PG}(2,p)\), Avoiding arithmetic progressions in cyclic groups
Cites Work
