Saturating sets in projective planes and hypergraph covers

DOI10.1016/j.disc.2018.01.011zbMath1380.05145arXiv1701.01379OpenAlexW2963718715MaRDI QIDQ1699553

Zoltán Lóránt Nagy

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.01379

zbMATH Keywords

projective planetransversalblocking setcomplete arcsdense sethypergraph coversaturating set

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15) General theory of linear incidence geometry and projective geometries (51A05)

Related Items (4)

Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ Saturating linear sets of minimal rank ⋮ On the balanced upper chromatic number of finite projective planes ⋮ New bounds for linear codes of covering radii 2 and 3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
• Linear nonbinary covering codes and saturating sets in projective spaces
• Saturated configurations of points in projective Galois spaces
• On the ratio of optimal integral and fractional covers
• Intersecting designs from linear programming and graphs of diameter two
• On saturating sets in projective spaces.
• Small complete arcs in projective planes
• Matchings and covers in hypergraphs
• Transversal numbers for hypergraphs arising in geometry
• Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
• On defining sets for projective planes
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• 1-Saturating Sets, Caps, and Doubling-Critical Sets in Binary Spaces
• Finite Geometry and Combinatorial Applications

This page was built for publication: Saturating sets in projective planes and hypergraph covers