Random constructions and density results
From MaRDI portal
Publication:1009013
DOI10.1007/s10623-007-9149-3zbMath1185.51011OpenAlexW2074069969MaRDI QIDQ1009013
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9149-3
Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20)
Related Items (11)
Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ Partition dimension of projective planes ⋮ On the spectrum of sizes of semiovals contained in the Hermitian curve ⋮ New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane ⋮ On the metric dimension of incidence graph of M\"obius planes ⋮ Maximal partial line spreads of non-singular quadrics ⋮ On the spectrum of the sizes of semiovals in PG\((2,q), q\) odd ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane ⋮ Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture ⋮ On coupon colorings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal partial spreads and the modular \(n\)-queen problem
- New examples of complete k-arcs in PG(2,q)
- On small blocking sets and their linearity
- On the number of pairwise non-isomorphic minimal blocking sets in \(\mathrm{PG}(2,q)\)
- On a packing and covering problem
- Small complete arcs in Galois planes
- Lower bounds on blocking sets
- \(\epsilon\)-nets and simplex range queries
- Near perfect coverings in graphs and hypergraphs
- Saturated configurations of points in projective Galois spaces
- On (k,n)-blocking sets which can be obtained as a union of conics
- Graphs which contain all small graphs
- A dense infinite Sidon sequence
- Constructions of large arcs and blocking sets in finite planes
- Almost tight bounds for \(\epsilon\)-nets
- Note on the existence of large minimal blocking sets in Galois planes
- On a problem of Erdős and Lovász: Random lines in a projective plane
- Blocking sets and complete k-arcs
- On the ratio of optimal integral and fractional covers
- Blocking sets
- On the size of a maximal partial spread
- Blocking sets in Desarguesian affine and projective planes
- On small blocking sets
- Normal spreads
- Small blocking sets of Hermitian designs
- On the size of a blocking set in \(\text{PG}(2,p)\)
- A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
- On maximal partial spreads in \(PG\)(\(n\), \(q\))
- Small complete arcs in projective planes
- On a particular class of minihypers and its applications. II: Improvements for \(q\) square
- Matchings and covers in hypergraphs
- On a particular class of minihypers and its applications. I: The result for general \(q\)
- Maximal partial spreads and the modular \(n\)-queen problem. II
- Superpolynomial lower bounds for monotone span programs
- Blocking sets in \(\mathrm{PG}(r,q^n)\)
- On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
- Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
- Spreads and a conjecture of Bruck and Bose
- On defining sets for projective planes
- On the minimum number of blocks defining a design
- On a Problem of Erdos and Lovasz. II: n(r) = O(r)
- Concentration of non‐Lipschitz functions and applications
- On large minimal blocking sets in PG(2,q)
- On blocking sets of inversive planes
- Note on disjoint blocking sets in Galois planes
- Baer subplanes and blocking sets
- A Constructive Solution to a Tournament Problem
- Partial Spreads and Replaceable Nets
- Blocking Sets in Finite Projective Planes
- On a Problem in Graph Theory
- A maximal partial spread of size 45 in \(PG(3,7)\)
- Concentration of multivariate polynomials and its applications
- Upper bounds on the covering number of Galois-planes with small order
- A lemma on the randomness of \(d\)th powers in \(\text{GF}(q),\;d\mid q-1\)
- Maximal partial spreads and the modular \(n\)-queen problem. III
- Small complete arcs in André planes of square order
This page was built for publication: Random constructions and density results
