Skip to main content
Log in

On the chromatic number of ℝ9

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

In this work, the previous lower bound is considerably strengthened for the chromatic number of the nine-dimensional space.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry, Springer, Berlin (2005).

    MATH  Google Scholar 

  2. K. Cantwell, “Finite Euclidean Ramsey theory,” J. Combin. Theory, Ser. A, 73, No. 2, 273–285 (1996).

    MATH  MathSciNet  Google Scholar 

  3. J. Cibulka, “On the chromatic number of real and rational spaces,” Geombinatorics, 18, No. 2, 53–66 (2008).

    MATH  MathSciNet  Google Scholar 

  4. A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii, and S. A. Usachev, “On the independence numbers of some distance graphs with vertices in {−1, 0, 1}n: estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger and Borsuk problems,” Mat. Zametki (2009).

  5. L. L. Ivanov, “An estimate for the chromatic number of the space ℝ4,” Usp. Mat. Nauk, 61, No. 5, 371–372 (2006).

    Google Scholar 

  6. N. N. Kuzyurin, “Asymptotic investigation of the set covering problem,” Probl. Kibern., No. 37, 19–56 (1980).

  7. D. G. Larman and C. A. Rogers, “The realization of distances within sets in Euclidean space,” Mathematika, 19, 1–24 (1972).

    Article  MATH  MathSciNet  Google Scholar 

  8. L. Moser and W. Moser, “Solution to problem 10,” Can. Math. Bull., 4, 187–189 (1961).

    Google Scholar 

  9. O. Nechushtan, “On the space chromatic number,” Discrete Math., 256, 499–507 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  10. A. M. Raigorodskii, “Systems of common representatives,” Fundam. Prikl. Mat., 5, No. 3, 851–860 (1999).

    MathSciNet  Google Scholar 

  11. A. M. Raigorodskii, “The Borsuk problem and the chromatic numbers of some metric spaces,” Russ. Math. Surv., 56, No. 1, 103–139 (2001).

    Article  MathSciNet  Google Scholar 

  12. A. M. Raigorodskii, The Chromatic Numbers [in Russian], Moscow Center for Continuous Mathematical Education (MCCME), Moscow (2003).

  13. A. M. Raigorodskii, The Linear Algebra Method in Combinatorics [in Russian], Moscow Center for Continuous Mathematical Education (MCCME), Moscow (2007).

  14. A. Soifer, “The chromatic number of the plane: its past, present and future,” Mat. Prosveshchenie, No. 8 (2004).

  15. L. A. Székely, “Erdős on unit distances and the Szemerédi–Trotter theorems,” in: G. Halász, ed., Paul Erdős and His Mathematics II. Based on Conf., Budapest, Hungary, July 4–11, 1999, Bolyai Soc. Math. Stud., Vol. 11, Springer, Berlin (2002), pp. 649–666.

    Google Scholar 

  16. V. E. Tarakanov, Combinatorial Problems and (0, 1)-Matrices [in Russian], Nauka, Moscow (1985).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. B. Kupavskii.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 14, No. 5, pp. 139–154, 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kupavskii, A.B., Raigorodskii, A.M. On the chromatic number of ℝ9 . J Math Sci 163, 720–731 (2009). https://doi.org/10.1007/s10958-009-9708-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-009-9708-4

Keywords

Navigation