Article contents
A Ramsey-Type Theorem in the Plane
Published online by Cambridge University Press: 12 September 2008
Abstract
We show that, for any finite set P of points in the plane and for any integer k ≥ 2, there is a finite set R = R(P, k) with the following property: for any k-colouring of R there is a monochromatic set , ⊆ R, such that is combinatorially equivalent to the set P, and the convex hull of P contains no point of R \ . We also consider related questions for colourings of p-element subsets of R (p > 1), and show that these analogues have negative solutions.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1994
References
- 7
- Cited by