Coloring ${\mathbb R}^n$
HTML articles powered by AMS MathViewer
- by James H. Schmerl PDF
- Trans. Amer. Math. Soc. 354 (2002), 967-974 Request permission
Abstract:
If $1 \leq m \leq n$ and $A \subseteq {\mathbb R}$, then define the graph $G(A,m,n)$ to be the graph whose vertex set is ${\mathbb R}^n$ with two vertices $x,y \in {\mathbb R}^n$ being adjacent iff there are distinct $u,v \in A^m$ such that $\|x-y\| = \|u-v\|$. For various $m$ and $n$ and various $A$, typically $A = {\mathbb Q}$ or $A = {\mathbb Z}$, the graph $G(A,m,n)$ can be properly colored with $\omega$ colors. It is shown that in some cases such a coloring $\varphi : {\mathbb R}^n \longrightarrow \omega$ can also have the additional property that if $\alpha : {\mathbb R}^m \longrightarrow {\mathbb R}^n$ is an isometric embedding, then the restriction of $\varphi$ to $\alpha (A^m)$ is a bijection onto $\omega$.References
- P. Erdős, Problems and results in chromatic graph theory, Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968) Academic Press, New York, 1969, pp. 27–35. MR 0252273
- P. Erdős and P. Komjáth, Countable decompositions of $\textbf {R}^2$ and $\textbf {R}^3$, Discrete Comput. Geom. 5 (1990), no. 4, 325–331. MR 1043714, DOI 10.1007/BF02187793
- S. Jackson and R.D. Mauldin, On a lattice problem of H. Steinhaus (preprint, Feb., 2001).
- Péter Komjáth, A lattice-point problem of Steinhaus, Quart. J. Math. Oxford Ser. (2) 43 (1992), no. 170, 235–241. MR 1164626, DOI 10.1093/qmath/43.2.235
- Péter Komjáth, A decomposition theorem for $\textbf {R}^n$, Proc. Amer. Math. Soc. 120 (1994), no. 3, 921–927. MR 1169038, DOI 10.1090/S0002-9939-1994-1169038-0
- P. Komjáth, A coloring result for the plane, J. Appl. Anal. 5 (1999), no. 1, 113–117. MR 1690059, DOI 10.1515/JAA.1999.113
- James H. Schmerl, Countable partitions of Euclidean space, Math. Proc. Cambridge Philos. Soc. 120 (1996), no. 1, 7–12. MR 1373342, DOI 10.1017/S0305004100074612
Additional Information
- James H. Schmerl
- Affiliation: Department of Mathematics, University of Connecticut, Storrs, Connecticut 06269-3009
- MR Author ID: 156275
- ORCID: 0000-0003-0545-8339
- Email: schmerl@math.uconn.edu
- Received by editor(s): December 15, 2000
- Received by editor(s) in revised form: May 7, 2001
- Published electronically: October 31, 2001
- © Copyright 2001 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 354 (2002), 967-974
- MSC (2000): Primary 03E02, 05C62
- DOI: https://doi.org/10.1090/S0002-9947-01-02881-1
- MathSciNet review: 1867367