Skip to main content
SpringerLink
Log in

Distance graphs with large chromatic numbers and small clique numbers

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

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

References

  1. D. G. Larman and C. A. Rogers, Mathematika 19, 1–24 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  2. A. M. Raigorodskii, Russ. Math. Surv. 55, 351–352 (2000).

    Article  MathSciNet  Google Scholar 

  3. A. M. Raigorodskii, Russ. Math. Surv. 56, 103–139 (2001).

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. A. M. Raigorodskii, Russ. Math. Surv. 62, 1224–1225 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Erdös, Canad. Math. Bull. 11, 34–38 (1959).

    MATH  Google Scholar 

  7. A. M. Raigorodskii and O. I. Rubanov, in Number Theory and Applications: Proceedings of International Conference on Number Theory and Cryptography (Hindustan Book Agency, Allahabad, 2009), pp. 149–157.

    Google Scholar 

  8. A. M. Raigorodskii and O. I. Rubanov, Math. Notes 87, 392–402 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  9. E. E. Demekhin, A. M. Raigorodskii, and O. I. Rubanov, “Distance Graphs with a Large Chromatic Number but without Cliques or Cycles of Given Size,” arXiv: 1202.2968v1.

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

    Google Scholar 

  11. P. Frankl and R. Wilson, Combinatorica 1, 357–368 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  12. K. Pràñhar, Primzahlverteilung (Springer-Verlag, Berlin, 1957; Mir, Moscow, 1967).

    Google Scholar 

  13. N. Alon and J. Spencer, The Probabilistic Method (Wiley, New York, 2002; Binom, Moscow, 2007).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology (Technical University), Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700, Russia

    A. B. Kupavskii & A. M. Raigorodskii

  2. Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119992, Russia

    A. M. Raigorodskii

Authors
  1. A. B. Kupavskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. M. Raigorodskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. B. Kupavskii.

Additional information

Original Russian Text © A.B. Kupavskii, A.M. Raigorodskii, 2012, published in Doklady Akademii Nauk, 2012, Vol. 444, No. 5, pp. 483–487.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kupavskii, A.B., Raigorodskii, A.M. Distance graphs with large chromatic numbers and small clique numbers. Dokl. Math. 85, 394–398 (2012). https://doi.org/10.1134/S1064562412030295

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation