# Coloring Points in the Plane and Elsewhere

There is a class of exciting problems that fall under the purview of what is called *Euclidean Ramsey Theory*. Points on a line, in a plane or space are assigned colors - are getting colored, so to speak. A configuration of points is said to be *monochromatic* if all the points in the configuration are of the same color. The theory clarifies the question of what kind of monochromatic configurations are there?

Points in the plane are each colored with one of two colors: red or blue. Prove that, for a given distance

*d*, there always exist two points of the same color at the distance*d*from each other. (Solution)Points in the plane are each colored with one of three colors: red, green, or blue. Prove that, for a given distance

*d*, there always exist two points of the same color at the distance*d*from each other. (Solution)Points in the plane are each colored with one of two colors: red or blue. The set of distances between the blue points is blue and the set of distances between the red points is red. Prove that either one or the other contains all the positive reals. (Solution)

Points on a straight line are colored in two colors. Prove that it is always possible to find three points of the same color with one being the midpoint of the other two. (Solution)

Points in the plane are colored in two colors. Prove that it is always possible to find a monochromatic equilateral triangle, i.e., three points of the same color with all pairwise distances equal. (Solution)

Is there a coloring of the plane with three colors such that any straight line is bichromatic, i.e. only contains points of two colors? (Solution)

If each point of the plane is colored red or blue then some rectangle has its vertices all the same color. (Solution)

Six points are given in the space such that the pairwise distances between them are all distinct. Consider the triangles with vertices at these points. Prove that the longest side of one of these triangles is at the same time the shortest side of another. (Solution

The design obtained by cutting the plane with straight lines can be colored with just two colors so that no two regions that share a side are of the same color. (Solution)

### References

- R. L. Graham,
__Euclidean Ramsey Theory__, in*Handbook of Discrete and Computational Mathematics*, J. E. Goodman, J. O'Rourke (eds), Chapman & Hall/CRC, 2004 - R. B. J. T. Allenby, A. Slomson,
*How to Count: An Introduction to Combinatorics*, CRC Press, 2011 (2nd edition) - A. Soifer,
*Geometric Etudes in Combinatorial Mathematics*, Springer, 2010 (2nd, expanded edition)

- Ramsey's Theorem
- Party Acquaintances
- Ramsey Number R(3, 3, 3)
- Ramsey Number R(4, 3)
- Ramsey Number R(5, 3)
- Ramsey Number R(4, 4)
- Geometric Application of Ramsey's Theory
- Coloring Points in the Plane and Elsewhere
- Two Colors - Two Points
- Three Colors - Two Points
- Two Colors - All Distances
- Two Colors on a Straight Line
- Two Colors - Three Points
- Three Colors - Bichromatic Lines
- Chromatic Number of the Plane
- Monochromatic Rectangle in a 2-coloring of the Plane
- Two Colors - Three Points on Circle
- Coloring a Graph
- No Equilateral Triangles, Please

|Contact| |Front page| |Contents| |Up| |Store|

Copyright © 1996-2017 Alexander Bogomolny

62020694 |