Lower bounds for coverings of pairs by large blocks
From MaRDI portal
(Redirected from Publication:910408)
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
Cites work
- scientific article; zbMATH DE number 3873349 (Why is no real title available?)
- scientific article; zbMATH DE number 3922663 (Why is no real title available?)
- scientific article; zbMATH DE number 3695222 (Why is no real title available?)
- scientific article; zbMATH DE number 3235247 (Why is no real title available?)
- scientific article; zbMATH DE number 3198027 (Why is no real title available?)
- On a packing and covering problem
- On coverings
Cited in
(8)- scientific article; zbMATH DE number 4004204 (Why is no real title available?)
- scientific article; zbMATH DE number 4079445 (Why is no real title available?)
- On the non-existence of pair covering designs with at least as many points as blocks
- Covering pairs by \(q^ 2+q+1\) sets
- Generalising Fisher's inequality to coverings and packings
- New lower bounds for \(t\)-coverings
- What we know and what we do not know about Turán numbers
- scientific article; zbMATH DE number 2149836 (Why is no real title available?)
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)
