### Abstract

Given a finite n-element set X, a family of subsets F⊂2^{X} is said to separate X if any two elements of X are separated by at least one member of F. It is shown that if |F|>2^{n−1}, then one can select ⌈logn⌉+1 members of F that separate X. If |F|≥α2^{n} for some 0<α<1/2, then logn+O(log1αloglog1α) members of F are always sufficient to separate all pairs of elements of X that are separated by some member of F. This result is generalized to simultaneous separation in several sets. Analogous questions on separation by families of bounded Vapnik–Chervonenkis dimension and separation of point sets in R^{d} by convex sets are also considered.

Original language | English |
---|---|

Pages (from-to) | 292-305 |

Number of pages | 14 |

Journal | Journal of Combinatorial Theory. Series A |

Volume | 144 |

DOIs | |

Publication status | Published - Nov 1 2016 |

### Keywords

- Erdős–Szekeres theorem
- Search theory
- Separation
- VC-dimension

### ASJC Scopus subject areas

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

## Fingerprint Dive into the research topics of 'Separation with restricted families of sets'. Together they form a unique fingerprint.

## Cite this

*Journal of Combinatorial Theory. Series A*,

*144*, 292-305. https://doi.org/10.1016/j.jcta.2016.06.002