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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics