Covering all points except one
From MaRDI portal
The authors deal with point-line geometries, to cover all points except one, more lines are needed than to cover all points. Bounds can be given with the dimension of the space of functions induced by polynomials of bounded degree.
Recommendations
Cites work
- A combinatorial characterization of Hermitian curves
- Blocking sets in PG(2, p) for small p, and partial spreads in PG(3,7)
- Covering finite fields with cosets of subspaces
- Covering the cube by affine hyperplanes
- scientific article; zbMATH DE number 1342085 (Why is no real title available?)
- scientific article; zbMATH DE number 1910290 (Why is no real title available?)
- On smallest covers of finite projective spaces
- On the ratio of optimal integral and fractional covers
- Partial covers of \(\mathrm{PG}(n, q)\)
- Punctured combinatorial Nullstellensätze
- The blocking number of an affine space
Cited in
(14)- On bisecants of Rédei type blocking sets and applications
- Covering symmetric sets of the Boolean cube by affine hyperplanes
- On almost \(k\)-covers of hypercubes
- A \(p\)-adic condition on the weight of a codeword of a linear code
- On the stability of small blocking sets
- On q-analogues and stability theorems
- Covering grids with multiplicity
- Gröbner bases for increasing sequences
- Subspace coverings with multiplicities
- A stability theorem for lines in Galois planes of prime order
- Relative blocking sets of unions of Baer subplanes
- Covering the permutohedron by affine hyperplanes
- Almost covers of finite sets of points
- Partial covers of \(\mathrm{PG}(n, q)\)
This page was built for publication: Covering all points except one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961939)
