Accession Number:

AD0640304

Title:

MAXIMAL CONSISTENT FAMILIES OF TRIPLES,

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1966-09-01

Pagination or Media Count:

20.0

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

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE