Maximal consistent families of triples

Research output: Contribution to journalArticle

Abstract

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 problem in experimental design and in the design of systems involving shared use of system elements. This memorandum solves this problem in the case for which the subsets are each required to have three elements, and any pair of subsets have at most one element in common. 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 Triples Systems. The construction of the F is constructive. Structure Theorems are given determining the graph of doublets not covered by triplets in F.

Original languageEnglish (US)
Pages (from-to)1-8
Number of pages8
JournalJournal of Combinatorial Theory
Volume5
Issue number1
StatePublished - Jul 1968

Fingerprint

Subset
Steiner Triple System
Structure Theorem
Experimental design
Overlap
Intersection
Family
Graph in graph theory

Cite this

Maximal consistent families of triples. / Spencer, Joel.

In: Journal of Combinatorial Theory, Vol. 5, No. 1, 07.1968, p. 1-8.

Research output: Contribution to journalArticle

@article{b33e02f479484188aca02ce8bc5e107e,
title = "Maximal consistent families of triples",
abstract = "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 problem in experimental design and in the design of systems involving shared use of system elements. This memorandum solves this problem in the case for which the subsets are each required to have three elements, and any pair of subsets have at most one element in common. 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 Triples Systems. The construction of the F is constructive. Structure Theorems are given determining the graph of doublets not covered by triplets in F.",
author = "Joel Spencer",
year = "1968",
month = "7",
language = "English (US)",
volume = "5",
pages = "1--8",
journal = "Journal of Combinatorial Theory",
issn = "0021-9800",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Maximal consistent families of triples

AU - Spencer, Joel

PY - 1968/7

Y1 - 1968/7

N2 - 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 problem in experimental design and in the design of systems involving shared use of system elements. This memorandum solves this problem in the case for which the subsets are each required to have three elements, and any pair of subsets have at most one element in common. 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 Triples Systems. The construction of the F is constructive. Structure Theorems are given determining the graph of doublets not covered by triplets in F.

AB - 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 problem in experimental design and in the design of systems involving shared use of system elements. This memorandum solves this problem in the case for which the subsets are each required to have three elements, and any pair of subsets have at most one element in common. 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 Triples Systems. The construction of the F is constructive. Structure Theorems are given determining the graph of doublets not covered by triplets in F.

UR - http://www.scopus.com/inward/record.url?scp=0039313605&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039313605&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 1

EP - 8

JO - Journal of Combinatorial Theory

JF - Journal of Combinatorial Theory

SN - 0021-9800

IS - 1

ER -