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

DOI10.1016/0012-365X(90)90222-4zbMATH Open0733.05029OpenAlexW2085704797MaRDI QIDQ810035FDOQ810035

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

• Minimal clique partitions and pairwise balanced designs
• Title not available (Why is that?)
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The λ-μ Problem

Cited In (7)

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

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)