### Abstract

We answer some questions of Tverberg about separability properties of families of convex sets. In particular, we show that there is a family of infinitely many pairwise disjoint closed disks, no two of which can be separated from two others by a straight line. No such construction exists with equal disks. We also prove that every uncountable family of pairwise disjoint convex sets in the plane has two uncountable subfamilies that an be separated by a straight line.

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

Pages (from-to) | 427-433 |

Number of pages | 7 |

Journal | Discrete Mathematics |

Volume | 241 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Oct 28 2001 |

### Keywords

- Convex sets
- Infinite families
- Separation

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Separating convex sets by straight lines'. Together they form a unique fingerprint.

## Cite this

Pach, J., & Tardos, G. (2001). Separating convex sets by straight lines.

*Discrete Mathematics*,*241*(1-3), 427-433. https://doi.org/10.1016/S0012-365X(01)00128-5