Lower bounds for coverings of pairs by large blocks

DOI10.1007/BF02124682zbMATH Open0696.05009OpenAlexW2059244395MaRDI QIDQ910408FDOQ910408

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1153459
• A census of minimal pair-coverings with restricted largest block length
• On the number of covering blocks
• Existence of large sets of coverings with block size 3
• Lower bounds for covering problems
• New lower bounds for multiple coverings
• A new lower bound for the size of an affine blocking set
• Lower bounds for cover-free families
• A remark on covering blocks
• Covering with blocks in the non-symmetric case

zbMATH Keywords

projective planescoveringsaffine planes

Mathematics Subject Classification ID

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

Cites Work

• On a packing and covering problem
• Title not available (Why is that?)
• On coverings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Covering pairs by \(q^ 2+q+1\) sets
• New lower bounds for \(t\)-coverings
• What we know and what we do not know about Turán numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the non-existence of pair covering designs with at least as many points as blocks
• Title not available (Why is that?)
• Generalising Fisher's inequality to coverings and packings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910408)