On Partitioning Colored Points

Abstract

P. Kirchberger proved that, for a finite subset $X$ of $\mathbb{R}^{d}$ such that each point in $X$ is painted with one of two colors, if every $d+2$ or fewer points in $X$ can be separated along the colors, then all the points in $X$ can be separated along the colors. In this paper, we show a more colorful theorem.

Locations

• IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences - View
• arXiv (Cornell University) - View - PDF
• Kyoto University Research Information Repository (Kyoto University) - View - PDF
• DataCite API - View