Abstract
LetK be a configuration, a set of points in some finite-dimensional Euclidean space. Letn andk be positive integers. The notationR(K, n, r) is an abbreviation for the following statement: For everyr-coloring of the points of then-dimensional Euclidean space,R n, a monochromatic configurationL which is congruent toK exists.
A configurationK is Ramsey if the following holds: For every positive integerr, a positive integern=n(K, r) exists such that, for allm≥n, R(K, m, r) holds.
A configuration is spherical if it can be embedded in the surface of a sphere inn-space, providedn is sufficiently large. It is relatively easy to show that if a configuration is Ramsey, it must be spherical. Accordingly, a good fraction of the research efforts in Euclidean Ramsey theory is devoted to determining which spherical configurations are Ramsey. It is known that then-dimensional measure polytopes (the higher-dimensional analogs of a cube), then-dimensional simplex, and the regular polyhedra inR 2 andR 3 are Ramsey.
Now letE denote a set of edges in a configurationK. The pair (K, E) is called an edge-configuration, andR e (K, E, n, r) is used as an abbreviation for the following statement: For anyr-coloring of the edges ofR n, there is an edge configuration (L, F) congruent to (K, E) so that all edges inF are assigned the same color.
An edge-configuration isedge-Ramsey if, for allr≥1, a positive integern=n(K, E, r) exists so that ifm≥n, the statementR e (K, E, m, r) holds. IfK is a regular polytope, it is saidK isedge-Ramsey when the configuration determined by the set of edges of minimum length is edge-Ramsey.
It is known that then-dimensional simplex is edge-Ramsey and that the nodes of any edge-Ramsey configuration can be partitioned into two spherical sets. Furthermore, the edges of any edge-Ramsey configuration must all have the same length. It is conjectured that the unit square is edge-Ramsey, and it is natural to ask the more general question: Which regular polytopes are edge-Ramsey?
In this article it is shown that then-dimensional measure polytope and then-dimensional cross polytope are edge-Ramsey. It is also shown that these two infinite families and then-dimensional simplexes are the only regular edge-Ramsey polytopes, with the possible exceptions of the hexagon and the 24-cell.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
T. F. Banchoff,Beyond the Third Dimension, Scientific American Library, New York (1990).
G. J. Butler, Simultaneous packing and covering in Euclidean space,Proc. London Math. Soc. 3 (1972), 721–735.
K. Cantwell, Euclidean Ramsey Theory, Ph.D. Thesis, Arizona State University (1992).
H. S. M. Coxeter,Regular Polytopes, Macmillan, New York (1963).
P. Erdös, R. L. Graham, P. Montgomery, B. L. Rothschild, J. Spencer, and E. G. Straus, Euclidean Ramsey theorems, I,J. Combin. Theory 14 (1973), 341–363.
P. Erdös, R. L. Graham, P. Montgomery, B. L. Rothschild, J. Spencer, and E. G. Straus, Euclidean Ramsey theorems, II, inFinite and Infinite Sets, Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam (1973), pp. 529–558.
P. Erdös, R. L. Graham, P. Montgomery, B. L. Rothschild, J. Spencer, and E. G. Straus, Euclidean Ramsey theorems, III, inFinite and Infinite Sets, Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam (1973), pp. 559–583.
P. Erdös and C. A. Rogers, Covering space with convex bodies,Acta Arith. 7 (1962), 281–285.
P. Frankl and V. Rödl, All triangles are Ramsey,Trans. Amer. Math. Soc. 29 (1980), 777–779.
P. Frankl and V. Rödl, Forbidden intersections,Trans. Amer. Math. Soc. 30 (1987), 249–255.
P. Frankl and V. Rödl, A partition property of simplices in Euclidean space,J. Amer. Math. Soc. 3 (1990), 1–7.
P. Frankl and I. G. Rosenberg, A finite set intersection theorem,European J. Combin. 2 (1981), 127–129.
P. Frankel and R. M. Wilson, Intersection theorems with geometric consequences,Combinatorica 4 (1981), 357–368.
R. L. Graham,Rudiments of Ramsey Theory, American Mathematical Society, Providence, RI (1980).
R. L. Graham, Euclidean Ramsey theorems in then-sphere,J. Graph Theory 7 (1983), 105–114.
R. L. Graham, Old and new Euclidean Ramsey theorems, inDiscrete Geometry and Convexity, Ann. New York Acad. Sci., vol. 440 (1985), pp. 20–30.
R. L. Graham, Topics in Euclidean Ramsey theory, inMathematics of Ramsey Theory, Springer-Verlag, New York (1990), pp. 200–213.
R. L. Graham, B. L. Rothschild, and J. Spencer,Ramsey theory, 2nd edn., Wiley, New York (1990).
B. Grünbaum,Convex Polytopes, Interscience, London, (1967).
R. Juhász, Ramsey type theorems in the plane,J. Combin. Theory Ser. A 27 (1979), 132–160.
I. Kříž, Permutation groups in Ramsey theory, Preprint.
D. G. Larman and C. A. Rogers, The realization of distances within sets in Euclidean space,Mathematika 19 (1972), 1–24.
P. Pearce and S. Pearce,Polyhedra Primer, Van Nostrand Reinhold, New York (1978).
H. S. Promel and Bernd Voigt,Aspects of Ramsey Theory I. Sets II. Arithmetic Progressions III. Parameter Sets, Fasind Institute for Diskrete Mathematics, Bonn (1989).
V. Rödl, On a problem in combinatorial geometry,Discrete Math. 45 (1983), 129–131.
L. E. Shader, All right triangles are Ramsey inE 2,J. Combin. Theory Ser. A 20 (1976), 385–389.
L. A. Székely and W. C. Wormald, Bounds on the measurable chromatic number ofR n Discrete Math. 75 (1989), 343–372.
D. R. Woodall, Distance realized by sets covering the plane,J. Combin. Theory Ser. A 14 (1973), 187–200.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cantwell, K. Edge-Ramsey theory. Discrete Comput Geom 15, 341–352 (1996). https://doi.org/10.1007/BF02711499
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02711499