Balancing families of sets

John E. Olson; Joel H. Spencer

doi:10.1016/0097-3165(78)90028-6

Balancing families of sets

John E. Olson, Joel H. Spencer

Research output: Contribution to journal › Article › peer-review

Abstract

Given k finite sets S₁,...,S_k, to what extent is it possible to partition their union into two parts A and B in such a way that, for each j, S_j ∩ A and S_j ∩ B contain approximately the same number of elements? Bounds are found for this and similar questions.

Original language	English (US)
Pages (from-to)	29-37
Number of pages	9
Journal	Journal of Combinatorial Theory, Series A
Volume	25
Issue number	1
DOIs	https://doi.org/10.1016/0097-3165(78)90028-6
State	Published - Jul 1978

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0097-3165(78)90028-6

Cite this

@article{3917256880504cf088cf096040dd6487,

title = "Balancing families of sets",

abstract = "Given k finite sets S1,...,Sk, to what extent is it possible to partition their union into two parts A and B in such a way that, for each j, Sj ∩ A and Sj ∩ B contain approximately the same number of elements? Bounds are found for this and similar questions.",

author = "Olson, {John E.} and Spencer, {Joel H.}",

year = "1978",

month = jul,

doi = "10.1016/0097-3165(78)90028-6",

language = "English (US)",

volume = "25",

pages = "29--37",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Balancing families of sets

AU - Olson, John E.

AU - Spencer, Joel H.

PY - 1978/7

Y1 - 1978/7

N2 - Given k finite sets S1,...,Sk, to what extent is it possible to partition their union into two parts A and B in such a way that, for each j, Sj ∩ A and Sj ∩ B contain approximately the same number of elements? Bounds are found for this and similar questions.

AB - Given k finite sets S1,...,Sk, to what extent is it possible to partition their union into two parts A and B in such a way that, for each j, Sj ∩ A and Sj ∩ B contain approximately the same number of elements? Bounds are found for this and similar questions.

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

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

U2 - 10.1016/0097-3165(78)90028-6

DO - 10.1016/0097-3165(78)90028-6

M3 - Article

AN - SCOPUS:0347252643

SN - 0097-3165

VL - 25

SP - 29

EP - 37

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 1

ER -

Balancing families of sets

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this