The blocking number of an affine space
From MaRDI portal
Publication:1244233
A short proof is given of the fact that the minimum cardinality of a subset of \(\text{AG}(k, q)\) which intersects all hyperplanes is \(k(q-1) + 1\). In case \(k = 2\) this settles a conjecture of J. Doyen. Independently \textit{R. E. Jamison} [J. Comb. Theory, Ser. A 22, 253--266 (1977; Zbl 0354.12019)] proved a more general result.
Recommendations
Cites work
Cited in
(60)- On generalized Ramsey numbers for trees
- More on maximal intersecting families of finite sets
- Heden's bound on maximal partial spreads
- Weighted arcs, the finite Radon transform and a Ramsey problem
- Polynomial multiplicities over finite fields and intersection sets
- Small transversals in hypergraphs
- On Turan hypergraphs
- Blocking sets in Desarguesian affine and projective planes
- On nuclei and blocking sets in Desarguesian spaces
- Small blocking sets of Hermitian designs
- On the size of a blocking set in \(\text{PG}(2,p)\)
- On nuclei and affine blocking sets
- On intersection sets in Desarguesian affine spaces
- A new lower bound for the size of an affine blocking set
- Book review of: L. Guth, Polynomial methods in combinatorics
- On bisecants of Rédei type blocking sets and applications
- Matchings and covers in hypergraphs
- Unique reducibility of multiple blocking sets
- Uncertainty in finite planes
- Covering symmetric sets of the Boolean cube by affine hyperplanes
- A general construction for blocking sets in finite affine geometries
- On almost \(k\)-covers of hypercubes
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- 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
- A note on intersecting hypergraphs with large cover number
- Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\)
- Multiple blocking sets and multisets in Desarguesian planes
- Constructing minimal blocking sets using field reduction
- Blocking and double blocking sets in finite planes
- Minimal Symmetric Differences of Lines in Projective Planes
- On the stability of small blocking sets
- On q-analogues and stability theorems
- On the metric dimension of affine planes, biaffine planes and generalized quadrangles
- On zeros of a polynomial in a finite grid
- Covers in partitioned intersecting hypergraphs
- On the Alon-Füredi bound
- Proof of a conjecture of Metsch
- Covering all points except one
- Punctured combinatorial Nullstellensätze
- Strong blocking sets and minimal codes from expander graphs
- Gröbner bases for increasing sequences
- Subspace coverings with multiplicities
- A stability theorem for lines in Galois planes of prime order
- Perspective on complexity measures targeting read-once branching programs
- Relative blocking sets of unions of Baer subplanes
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle
- Hyperplane covers of finite spaces and applications
- Generalizing blocking semiovals in finite projective planes
- Maximal line-free sets in \(\mathbb{F}_p^n\)
- Expander graphs, strong blocking sets and minimal codes (extended abstract)
- Covering the permutohedron by affine hyperplanes
- Exploring homological properties of independence complexes of Kneser graphs
- Almost covers of finite sets of points
- A nowhere-zero point in linear mappings
- Local constraints ensuring small representing sets
- Avoiding arithmetic progressions in cyclic groups
- Applications of finite fields to combinatorics and finite geometries
- Coverings of Abelian groups and vector spaces.
- Some self-blocking block designs
This page was built for publication: The blocking number of an affine space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244233)
