MAXIMAL CONSISTENT FAMILIES OF TRIPLES,
Abstract
A family F of three element subsets of an n-element set Sn is called n-consistent if the intersection of any two sets of F contain at most one element of Sn. We find maximal (in number of elements) F for all n. For certain n the F are Steiner Triple Systems. The construction of the F is constructive. Structure Theorems are given determining the graph of doublets not covered by triplets in F. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1966
- Accession Number
- AD0640304
Entities
People
- Joel Spencer
Organizations
- RAND Corporation