Balancing families of sets

John E. Olson, Joel H. Spencer

Research output: Contribution to journalArticlepeer-review


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
Issue number1
StatePublished - Jul 1978

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Balancing families of sets'. Together they form a unique fingerprint.

Cite this