Maximal consistent families of triples

by J. H. Spencer

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback20 pages $20.00 $16.00 20% Web Discount

The general problem of dividing a set into a maximal collection of subsets in such a way that the subsets will overlap in certain specified ways is a fundamental problemm in experimental design and in the design of systems, involving shared use of system elements. This study solves the problem for the case where the subsets are each required to have three elements, and any pair of subsets has at most one element in common.

This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.