2000 character limit reached
On Partitioning Colored Points (1011.3451v1)
Published 15 Nov 2010 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
