Balancing families of sets

https://doi.org/10.1016/0097-3165(78)90028-6Get rights and content
Under an Elsevier user license
open archive

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, SjA and SjB contain approximately the same number of elements? Bounds are found for this and similar questions.

Cited by (0)