Skip to main content
Log in

New lower bound for the chromatic number of a rational space with one and two forbidden distances

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

A new lower bound for the chromatic number χ(ℚn) of the space ℚn is obtained.

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. A. M. Raigorodskii, “On the chromatic number of a space,” Uspekhi Mat. Nauk 55(2), 147–148 (2000) [Russian Math. Surveys 55 (2), 351–352 (2000)].

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Benda and M. Perles, “Colorings of metric spaces,” Geombinatorics 9(3), 113–126 (2000).

    MATH  MathSciNet  Google Scholar 

  4. A. M. Raigorodskii, “Borsuk’s problem and the chromatic numbers of some metric spaces,” Uspekhi Mat. Nauk 56(1), 107–146 (2001) [Russian Math. Surveys 56 (1), 103–139 (2001)].

    Article  MathSciNet  Google Scholar 

  5. A. M. Raigorodskii, “On the chromatic number of a space with two forbidden distances,” Dokl. Ross. Akad. Nauk 408(5), 601–604 (2006).

    MathSciNet  Google Scholar 

  6. A. M. Raigorodskii and I. M. Shitova, “Chromatic numbers of real and rational spaces with real or rational forbidden distances,” Mat. Sb. 199(4), 107–142 (2008) [Sb. Math. 199 (4), 579–612 (2008)].

    Article  MathSciNet  Google Scholar 

  7. E. S. Gorskaya, I. M. Mitricheva, V. Yu. Protasov, and A. M. Raigorodskii, “Estimating the chromatic numbers of Euclidean space by convex minimization methods,” Mat. Sb. 200(6), 3–22 (2009) [Sb. Math. 200 (6), 783–801 (2009)].

    Article  MathSciNet  Google Scholar 

  8. F. M. de Oliveira Filho and F. Vallentin, “Fourier analysis, linear programming, and densities of distance avoiding sets in ℝn,” J. Eur. Math. Soc. (JEMS) 12(6), 1417–1428 (2010).

    Article  MATH  MathSciNet  Google Scholar 

  9. A. B. Kupavskiy, “On the chromatic number of ℝn with an arbitrary norm,” Discrete Math. 311(6), 437–440 (2011).

    Article  MATH  MathSciNet  Google Scholar 

  10. L. A. Székely, “Erdős on the unit distances and the Szemerédi-Trotter theorems,” in Paul Erdős and His Mathematics, II, Bolyai Soc. Math. Stud. (János Bolyai Math. Soc., Budapest, 2002), Vol. 11, pp. 649–666.

    Google Scholar 

  11. A. M. Raigorodskii, “Coloring distance graphs and graphs of diameters,” in Thirty Essays on Geometric Graph Theory (Springer, New York, 2013), pp. 429–460.

    Chapter  Google Scholar 

  12. A. M. Raigorodskii, Linear Algebraic Method in Combinatorics (MTsNMO, Moscow, 2007) [in Russian].

    Google Scholar 

  13. P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry (Springer, New York, 2005).

    MATH  Google Scholar 

  14. A. Soifer, Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of Its Creators (Springer, New York, 2009).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. I. Ponomarenko.

Additional information

Original Russian Text © E. I. Ponomarenko, A. M. Raigorodskii, 2015, published in Matematicheskie Zametki, 2015, Vol. 97, No. 2, pp. 255–261.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ponomarenko, E.I., Raigorodskii, A.M. New lower bound for the chromatic number of a rational space with one and two forbidden distances. Math Notes 97, 249–254 (2015). https://doi.org/10.1134/S0001434615010265

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0001434615010265

Keywords

Navigation