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 research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND 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.