On the constructive enumeration of packings and coverings of index one (Q2276965): Difference between revisions

The authors consider a computerized search for all solutions to various packing and covering problems in the classical case of k-sets from a v- set with \(\lambda =1\). The methods involve straightforward search.

0 references

zbMATH Keywords

computerized search

0 references

packing and covering problems

0 references

reviewed by

Ralph G.Stanton

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Minimal coverings of pairs by triples

0 references

On coverings

0 references

Q5522938

0 references

Q3027020

0 references

Balanced incomplete block designs and related designs

0 references

Q4123341

0 references

Q3949071

0 references

Q3661598

0 references

Identifiers

zbMATH Open document ID

0724.05015

0 references

DOI

10.1016/0012-365X(89)90363-4

0 references

Mathematics Subject Classification ID

05B40

0 references

zbMATH DE Number

4193687

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2276965

@@ Property / cites work @@
+Minimal coverings of pairs by triples
@@ Property / cites work: Minimal coverings of pairs by triples / rank @@
+Normal rank
@@ Property / cites work @@
+On coverings
@@ Property / cites work: On coverings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5522938
@@ Property / cites work: Q5522938 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3027020
@@ Property / cites work: Q3027020 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced incomplete block designs and related designs
+Normal rank
@@ Property / cites work @@
+Q4123341
@@ Property / cites work: Q4123341 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3949071
@@ Property / cites work: Q3949071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3661598
@@ Property / cites work: Q3661598 / rank @@
+Normal rank