Title
Euclidean ramsey theorems. I
Abstract
The general Ramsey problem can be described as follows: Let A and B be two sets, and R a subset of A × B. For a ϵ A denote by R(a) the set {b ϵ B | (a, b) ϵ R}. R is called r-Ramsey if for any r-part partition of B there is some a ϵ A with R(a) in one part. We investigate questions of whether or not certain R are r-Ramsey where B is a Euclidean space and R is defined geometrically.
Year
DOI
Venue
1973
10.1016/0097-3165(73)90011-3
Journal of Combinatorial Theory, Series A
Field
DocType
Volume
Discrete mathematics,Combinatorics,Euclidean space,Ramsey problem,Euclidean geometry,Partition (number theory),Mathematics
Journal
14
Issue
ISSN
Citations 
3
0097-3165
30
PageRank 
References 
Authors
10.56
0
6
Name
Order
Citations
PageRank
P Erdös1626190.85
Ronald L. Graham245551734.76
P Montgomery33010.56
B.L Rothschild44813.94
J Spencer53010.56
E.G Straus63912.60