Balanced line for a 3-colored point set in the plane
| dc.contributor.author | Bereg, Sergey | en_US |
| dc.contributor.author | Kano, Mikio | en_US |
| dc.contributor.utdAuthor | Bereg, Sergey | |
| dc.date.accessioned | 2013-08-01T19:16:07Z | |
| dc.date.available | 2013-08-01T19:16:07Z | |
| dc.date.created | 2012-02-07 | |
| dc.description.abstract | In this note we prove the following theorem. For any three sets of points in the plane, each of n ≥ 2 points such that any three points (from the union of three sets) are not collinear and the convex hull of 3n points is monochromatic, there exists an integer k ε {1, 2, ..., n-1} and an open half-plane containing exactly k points from each set. | en_US |
| dc.identifier.citation | Bereg, Sergey, and Mikio Kano. 2012. "Balanced Line for a 3-Colored Point Set in the Plane." Electronic Journal Of Combinatorics 19. | en_US |
| dc.identifier.issn | 1077-8926 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10735.1/2798 | |
| dc.identifier.volume | 19 | en_US |
| dc.rights | © 2012 Sergey Bereg and Mikio Kano | en_US |
| dc.source.journal | Electronic Journal Of Combinatorics | en_US |
| dc.title | Balanced line for a 3-colored point set in the plane | en_US |
| dc.type | text | en_US |
| dc.type.genre | article | en_US |