Balancing families of sets

John E. Olson, Joel H. Spencer

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)29-37
Number of pages9
JournalJournal of Combinatorial Theory, Series A
Volume25
Issue number1
StatePublished - Jul 1978

Fingerprint

Balancing
Finite Set
Union
Partition
Family

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Balancing families of sets. / Olson, John E.; Spencer, Joel H.

In: Journal of Combinatorial Theory, Series A, Vol. 25, No. 1, 07.1978, p. 29-37.

Research output: Contribution to journalArticle

Olson, John E. ; Spencer, Joel H. / Balancing families of sets. In: Journal of Combinatorial Theory, Series A. 1978 ; Vol. 25, No. 1. pp. 29-37.
@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 = "7",
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

M3 - Article

VL - 25

SP - 29

EP - 37

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 1

ER -