Skip to main content
SpringerLink
Log in

New upper bounds for the independence numbers of graphs with vertices in {−1, 0, 1}n and their applications to problems of the chromatic numbers of distance graphs

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

Upper bounds for the independence numbers in the graphs with vertices at {−1, 0, 1}n are improved. Their applications to problems of the chromatic numbers of distance graphs are studied.

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. P. Frankl and R. Wilson, “Intersection theorems with geometric consequences,” Combinatorica 1, 357–368 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  2. E. I. Ponomarenko and A. M. Raigorodskii, “Improvement of the Frankl-Wilson theorem on the number of edges of the hypergraph with forbidden intersections,” Dokl. Ross. Akad. Nauk 454(3), 268–269 (2014) [DokladyMath. 89 (1), 59–60 (2014)].

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. A. M. Raigorodskii, “On the chromatic numbers of spheres in Euclidean spaces,” Dokl. Ross. Akad. Nauk 432(2), 174–177 (2010) [Dokl.Math. 81 (3), 379–382 (2010)].

    Google Scholar 

  5. A. M. Raigorodskii, “On the chromatic numbers of spheres in ℝn,” Combinatorica 32(1), 111–123 (2012).

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Kahn and G. Kalai, “A counterexample to Borsuk’s conjecture,” Bull. Amer. Math. Soc. (N. S.) 29(1), 60–62 (1993).

    Article  MATH  MathSciNet  Google Scholar 

  7. A. M. Raigorodskii, “Three lectures on the Borsuk partition problem,” in Surveys in Contemporary Mathematics, LondonMath. Soc. Lecture Note Ser. (Cambridge Univ. Press, Cambridge, 2008), Vol. 347, pp. 202–247.

    Google Scholar 

  8. A. M. Raigorodskii, “Around the Borsuk conjecture,” in Sovrem. Mat. Fundam. Napravl., Vol. 23: Geometry and Mechanics(RUDN, Moscow, 2007), pp. 147–164 [J. Math. Sci. (N. Y.) 154 (4) 604–623 (2008)].

    Google Scholar 

  9. A. M. Raigorodskii, “Coloring Distance Graphs and Graphs of Diameters,” in Thirty Essays on Geometric Graph Theory (Springer, Berlin, 2013), pp. 429–460.

    Chapter  Google Scholar 

  10. A. M. Raigorodskii, “Counterexamples to Borsuk’s conjecture on spheres of small radius,” Dokl.Ross. Akad. Nauk Russian Academy of Sciences 434(2), 161–163 (2010) [Dokl.Math. 82 (2), 719–721 (2010)].

    MathSciNet  Google Scholar 

  11. A. M. Raigorodskii, “On dimensionality in the Borsuk problem,” UspekhiMat. Nauk 52(6), 181–182 (1997) [RussianMath. Surveys 52 (6), 1324–1325 (1997)].

    Article  MathSciNet  Google Scholar 

  12. A. M. Raigorodskii, “On a bound in the Borsuk problem,” Uspekhi Mat. Nauk 54(2), 185–186 (1999) [RussianMath. Surveys 54 (2), 453–454 (1999)].

    Article  MathSciNet  Google Scholar 

  13. A. M. Raigorodskii, “On the chromatic number of a space,” Uspekhi Mat. Nauk 55(2), 147–148 (2000) [RussianMath. Surveys 55 (2), 351–352 (2000)].

    Article  MATH  MathSciNet  Google Scholar 

  14. L. Bassalygo, G. Cohen, and G. Zémor, “Codes with forbidden distances,” Discrete Math. 213(1–3), 3–11 (2000).

    Article  MATH  MathSciNet  Google Scholar 

  15. A. É. Guterman, V. K. Lyubimov, A.M. Raigorodskii, and A. S. Usachev, “On the independence numbers of distance graphs with vertices at {−1, 0, 1}n,” Mat. Zametki 86(5), 794–796 (2009) [Math. Notes 86 (5), 744–746 (2009)].

    Article  MathSciNet  Google Scholar 

  16. A. É. Guterman, V. K. Lyubimov, A.M. Raigorodskii, and A. S. Usachev, “On the independence numbers of distance graphs with vertices in {−1, 0, 1}n: Estimates, Conjectures, and Applications to the Nelson-Erdős-Hadwiger and Borsuk problems,” in Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. i Ee Prilozh. (VINITI, Moscow, 2009), Vol. 65, pp. 82–100 [J.Math. Sci. 165 (6), 689–709 (2010)].

    Google Scholar 

  17. V. K. Lyubimov and A. M. Raigorodskii, “Lower bounds for the independence numbers of some distance graphs with vertices at {−1, 0, 1}n,” Dokl. Ross. Akad. Nauk 427(4), 458–460 (2009) [Dokl.Math. 80 (1), 547–549 (2009)].

    MathSciNet  Google Scholar 

  18. V. F. Moskva and A. M. Raigorodskii, “New lower bounds for the independence numbers of distance graphs with vertices at {−1, 0, 1}n,” Mat. Zametki 89(2), 319–320 (2011) [Math. Notes 89 (2), 307–308 (2011)].

    Article  MathSciNet  Google Scholar 

  19. A. M. Raigorodskii and A. A. Kharlamova, “On the sets of (−1, 0, 1)-vectors with forbidden values of pairwise inner products,” in Works in Vector and Tensor Analysis (Izd. Moskov. Univ., Moscow, 2013), Vol. 29 [in Russian].

    Google Scholar 

  20. A. M. Raigorodskii, Linear AlgebraicMethods in Combinatorics (MTsNMO, Moscow, 2007) [inRussian].

    Google Scholar 

  21. A. M. Raigorodskii, “The Borsuk problem for (0, 1)-polyhedra and cross polytopes,” Dokl. Ross. Akad. Nauk 371(5), 600–603 (2000).

    MathSciNet  Google Scholar 

  22. A. M. Raigorodskii, “The Borsuk problem for integral polyhedra,” Mat. Sb. 193(10), 139–160 (2002) [Sb. Math. 193 (10), 1535–1556 (2002)].

    Article  MathSciNet  Google Scholar 

  23. A. M. Raigorodskii, “The Borsuk problem for (0, 1)-polytopes and cross polytopes,” Dokl. Ross. Akad. Nauk 384(5), 593–597 (2002) [DokladyMath. 61, 256–259 (2002)].

    MathSciNet  Google Scholar 

  24. A. M. Raigorodskii, “The Borsuk and Grünbaum problems for some classes of polyhedra and graphs,” Dokl. Ross. Akad. Nauk 388(6), 738–742 (2003) [DokladyMath. 67 (1), 85–89 (2003)].

    MathSciNet  Google Scholar 

  25. A. M. Raigorodskii, “The Borsuk and Grünbaum problems for lattice polytopes,” Izv. Ross. Akad. Nauk Ser. Mat. 69(3), 81–108 (2005) [Izv.Math. 69 (3), 513–537 (2005)].

    Article  MathSciNet  Google Scholar 

  26. P. K. Agarwal and J. Pach, Combinatorial Geometry, in Wiley-Intersci. Ser. DiscreteMath. Optim. (John Wiley & Sons, New York, 1995).

    Google Scholar 

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

    MATH  Google Scholar 

  28. 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 Series Budapest, Bolyai Soc. Math. Stud. (János Bolyai Math. Soc., Budapest, 2002), Vol. 11, pp. 649–666.

    Google Scholar 

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

    MATH  Google Scholar 

  30. V. Klee and S. Wagon, Old and New Unsolved Problems in Plane Geometry and Number Theory, in Dolciani Math. Exp. (Math. Assoc. America, Washington, DC, 1991), Vol. 11.

    Google Scholar 

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

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology, Moscow, Russia

    E. I. Ponomarenko & A. M. Raigorodskii

  2. Moscow State University, Moscow, Russia

    A. M. Raigorodskii

Authors
  1. E. I. Ponomarenko
    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 E. I. Ponomarenko.

Additional information

Original Russian Text © E. I. Ponomarenko, A. M. Raigorodskii, 2014, published in Matematicheskie Zametki, 2014, Vol. 96, No. 1, pp. 138–147.

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 upper bounds for the independence numbers of graphs with vertices in {−1, 0, 1}n and their applications to problems of the chromatic numbers of distance graphs. Math Notes 96, 140–148 (2014). https://doi.org/10.1134/S000143461407013X

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation