Skip to main content
SpringerLink
Log in

Lower bound for the chromatic number of a rational space with metric l u and with one forbidden distance

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

New lower bounds for the chromatic number of the rational space in the Minkowski metric for certain irrational values of the forbidden distance are obtained.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. M. Raigorodskii, “On the chromatic number of a space,” Uspekhi Mat. Nauk 55 (2 (332)), 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. E. I. Ponomarenko and A. M. Raigorodskii, “New Lower Bound for the Chromatic Number of a Rational Space with One and Two Forbidden Distances,” Mat. Zametki 97 (2), 255–261 (2015) [Math. Notes 97 (1–2), 249–254 (2015)].

    Article  MATH  MathSciNet  Google Scholar 

  5. E. I. Ponomarenko and A. M. Raigorodskii, “A new lower bound for the chromatic number of the rational space,” UspekhiMat. Nauk 68 (5 (413)), 183–184 (2013) [RussianMath. Surveys 68 (5), 960–962 (2013)].

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. 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 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  11. A. Soifer, Mathematical Coloring Book (Springer, New York, 2009).

    MATH  Google Scholar 

  12. A. M. Raigorodskii, “The chromatic number of a space with the metric lq,” UspekhiMat. Nauk 59 (5 (359)), 161–162 (2004) [Russian Math. Surveys 59 (5), 973–975 (2004)].

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, Moscow, Russia

    Yu. A. Demidovich

Authors
  1. Yu. A. Demidovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. A. Demidovich.

Additional information

Original Russian Text © Yu. A. Demidovich, 2017, published in Matematicheskie Zametki, 2017, Vol. 102, No. 4, pp. 532–548.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Demidovich, Y.A. Lower bound for the chromatic number of a rational space with metric l u and with one forbidden distance. Math Notes 102, 492–507 (2017). https://doi.org/10.1134/S0001434617090218

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation