On the number of blocks in a perfect covering of v points

DOI10.1016/0012-365X(90)90222-4MaRDI QIDQ810035zbMATH OpenOpenAlexFDO

Authors R. S. Rees, D. R. Stinson

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90222-4

zbMATH Keywords

perfect covering

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cites work

• scientific article; zbMATH DE number 3987286 (Why is no real title available?)
• scientific article; zbMATH DE number 3715590 (Why is no real title available?)
• scientific article; zbMATH DE number 3743276 (Why is no real title available?)
• scientific article; zbMATH DE number 3747146 (Why is no real title available?)
• scientific article; zbMATH DE number 3767686 (Why is no real title available?)
• scientific article; zbMATH DE number 3797758 (Why is no real title available?)
• scientific article; zbMATH DE number 3337688 (Why is no real title available?)
• Minimal clique partitions and pairwise balanced designs
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• The λ-μ Problem

Cited in

(7)

• Pairwise balanced designs and sigma clique partitions
• The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)
• On the number of covering blocks
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• Linear spaces with many small lines
• On combinatorial designs with subdesigns
• A retrospective look at the Erdös-DeBruijn theorem

This page was built for publication: On the number of blocks in a perfect covering of v points

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