### Abstract

Given k finite sets S_{1},...,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 |

State | Published - Jul 1978 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

### Cite this

*Journal of Combinatorial Theory, Series A*,

*25*(1), 29-37.

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

Research output: Contribution to journal › Article

*Journal of Combinatorial Theory, Series A*, vol. 25, no. 1, pp. 29-37.

}

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

AN - SCOPUS:0347252643

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 -