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

DOI10.1016/0012-365X(90)90222-4zbMath0733.05029OpenAlexW2085704797MaRDI QIDQ810035

R. S. Rees, Douglas 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)

Related Items (6)

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

Cites Work

• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• Minimal clique partitions and pairwise balanced designs
• The λ-μ Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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