Balanced line for a 3-colored point set in the plane
type: Item
instance of: scholarly article
title: Balanced line for a 3-colored point set in the plane
zbMATH Open document ID: 1246.52011
author: Mikio Kano
author: Sergey Bereg
published in: The Electronic Journal of Combinatorics
publication date: 2012-06-12T00:00:00Z
full work available at URL: v19i1p33
review text: Summary: In this note we prove the following theorem. For any three sets of points in the plane, each of \(n\geq 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\in\{1,2,\dots,n-1\}\) and an open half-plane containing exactly \(k\) points from each set.
Mathematics Subject Classification ID: 52A37
zbMATH DE Number: 6045657
MaRDI profile type: Publication
Recommended article: Q3001813
Recommended article: Q3162465
Recommended article: Balanced partitions of 3-colored geometric sets in the plane
Recommended article: Balanced convex partitions of lines in the plane
Recommended article: On the number of balanced lines
Recommended article: Colouring the triangles determined by a point set
Recommended article: Balanced triangulations
Recommended article: Triangulations of Line Segment Sets in the Plane
Recommended article: Coloring copoints of a planar point set
Recommended article: Balanced partitions of two sets of points in the plane
description: scientific article; zbMATH DE number 6045657