Skip to main content
SpringerLink
Log in

Colorings of spaces, and random graphs

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

Abstract

This work deals with some problems on the embeddings of finite geometric graphs into the random ones. In particular, we study here applications of the random graph theory to the Nelson-Erdös-Hadwiger problem on coloring spaces.

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. N. Alon and J. Spencer, The Probabilistic Method, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York (2000).

    MATH  Google Scholar 

  2. B. Bollobás, “Martingales, isoperimetric inequalities, and random graphs,” in: A. Hajnal, L. Lovász, and V. T. Sós, eds., Proceedings, Eger (1987), Colloq. Math. Soc. János Bolyai, Vol. 52, North-Holland, Amsterdam (1987), pp. 113–139.

    Google Scholar 

  3. B. Bollobás, “The chromatic number of random graphs,” Combinatorica, 8, 49–56 (1988).

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Bollobás, Random Graphs, Cambridge Univ. Press, Cambridge (2001).

    MATH  Google Scholar 

  5. N. G. de Bruijn and P. Erdös, “A colour problem for infinite graphs and a problem in the theory of relations,” Proc. Konink. Nederl. Akad. Wetensch., Ser. A, 54, No. 5, 371–373 (1951).

    MATH  Google Scholar 

  6. D. Coulson, “A 15-colouring of 3-space omitting distance one,” Discrete Math., 256, 83–90 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  7. R. Diestel, Graph Theory, Springer (1997).

  8. P. Erdös and A. Rényi, “On random graphs. I,” Publ. Math. Debrecen, 6, 290–297 (1959).

    MathSciNet  MATH  Google Scholar 

  9. P. Erdös and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci. Ser. A, 5, 17–61 (1960).

    MATH  Google Scholar 

  10. P. Erdös and A. Rényi, “On the evolution of random graphs. II,” Bull. Inst. Int. Stat., 38, 343–347 (1961).

    MATH  Google Scholar 

  11. F. Harary, Graph Theory, Addison-Wesley, Reading (1969).

    Google Scholar 

  12. H. Hadwiger, “Ein Überdeckungssatz für den Euklidischen Raum,” Portugal. Math., 4, 140–144 (1944).

    MATH  MathSciNet  Google Scholar 

  13. H. Hadwiger, “Ungelöste Probleme N 40,” Elem. Math., 16, 103–104 (1961).

    MathSciNet  Google Scholar 

  14. S. Janson, “New versions of Suen’s correlation inequality,” Random Structures Algorithms, 13, 467–483 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  15. V. F. Kolchin, Random Graphs [in Russian], Fizmatlit, Moscow (2002).

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. A. M. Raigorodskii, “On the chromatic number of the space,” Russian Math. Surveys, 55, No. 2, 147–148 (2000).

    Article  MathSciNet  Google Scholar 

  20. A. M. Raigorodskii, “The Borsuk problem and the chromatic numbers of some metric spaces,” Russian Math. Surveys, 56, 103–139 (2001).

    Article  MathSciNet  Google Scholar 

  21. A. M. Raigorodskii, “The Erdös-Hadwiger problem and the chromatic numbers of finite geometric graphs,” Dokl. Ross. Akad. Nauk, 392, No. 3, 313–317 (2003).

    MathSciNet  Google Scholar 

  22. A. M. Raigorodskii, “The Nelson-Erdös-Hadwiger problem, and the embeddings of random graphs into the geometric one,” Dokl. Ross. Akad. Nauk, 403, No. 2 (2005).

    Google Scholar 

  23. A. M. Raigorodskii, The Chromatic Numbers of Metric Spaces [in Russian], Proc. Math. Inst. NAN Belarus (2005).

  24. A. M. Raigorodskii, “The Erdös-Hadwiger problem and the chromatic numbers of finite geometric graphs,” Mat. Sb., 196, No. 1, 123–156 (2005).

    MathSciNet  Google Scholar 

  25. A. Soifer, “Chromatic number of the plane: A historical essay,” Geombinatorics, 1, No. 3, 13–15 (1991).

    MathSciNet  Google Scholar 

  26. A. Soifer, Mathematical Coloring Book, Center for Excellence in Mathematical Education (1997).

  27. L. A. Székely, “Erdös on unit distances and the Szemerédi-Trotter theorems,” in: Paul Erdös and His Mathematics. II. Based on the conference, Budapest, Hungary, July 4–11, Bolyai Soc. Math. Stud., Vol. 11, Springer, Berlin (2002), pp. 649–666.

    Google Scholar 

  28. M. Talagrand, “Concentration of measures and isoperimetric inequalities in product spaces,” Publ. Math. IHES, 81, 73–205 (1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mechanics and Mathematics Faculty, Department of Mathematical Statistics and Stochastic Processes, Moscow State University, Russia

    A. M. Raigorodskii

Authors
  1. A. M. Raigorodskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. M. Raigorodskii.

Additional information

__________

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 6, pp. 131–141, 2005.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raigorodskii, A.M. Colorings of spaces, and random graphs. J Math Sci 146, 5723–5730 (2007). https://doi.org/10.1007/s10958-007-0388-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-007-0388-7

Keywords

Search

Navigation