Lower bounds for coverings of pairs by large blocks

DOI10.1007/BF02124682zbMath0696.05009OpenAlexW2059244395MaRDI QIDQ910408

D. T. Todorov

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02124682

zbMATH Keywords

projective planescoveringsaffine planes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Finite affine and projective planes (geometric aspects) (51E15) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

What we know and what we do not know about Turán numbers ⋮ On the non-existence of pair covering designs with at least as many points as blocks ⋮ Generalising Fisher's inequality to coverings and packings ⋮ Covering pairs by \(q^ 2+q+1\) sets

Cites Work

• On a packing and covering problem
• On coverings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for coverings of pairs by large blocks