Downloads: 143

Files in This Item:
File Description SizeFormat 
transfun.E94.A.1242.pdf176.16 kBAdobe PDFView/Open
Title: On Partitioning Colored Points
Authors: TODA, Takahisa
Author's alias: 戸田, 貴久
Keywords: Kirchberger's theorem
partition of a set
colorful theorem
Issue Date: Jun-2011
Publisher: The Institute of Electronics, Information and Communication Engineers
Journal title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume: E94-A
Issue: 6
Start page: 1242
End page: 1246
Abstract: P. Kirchberger proved that, for a finite subset X of 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.
Rights: © 2011 The Institute of Electronics, Information and Communication Engineers
URI: http://hdl.handle.net/2433/156785
DOI(Published Version): 10.1587/transfun.E94.A.1242
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.