Skip to main content
SpringerLink
Log in

On independence numbers of distance graphs with vertices in {-1,0,1}n: estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem

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

Abstract

The paper states and studies a problem that is closely related to the problems mentioned in the title.

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. J. Abello, P. M. Pardalos, and M. G. C. Resende, “On maximum clique problems in very large graphs,” http://citeseer.ist.psu.edu/abello99maximum.html.

  2. P. K. Agarwal and J. Pach, Combinatorial Geometry, John Wiley and Sons, New York (1995).

    MATH  Google Scholar 

  3. R. Ahlswede and V.M. Blinovsky, Lectures on Advances in Combinatorics, Springer (2008).

  4. R. Ahlswede and L. H. Khachatrian, “The complete nontrivial-intersection theorem for systems of finite sets,” Combin. Theory, Ser. A, 76, 121–138 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Ahlswede and L.H. Khachatrian, “The complete intersection theorem for systems of finite sets,” Eur. J. Combin., 18, 125–136 (1997).

    Article  MATH  MathSciNet  Google Scholar 

  6. N. Alon and J. Spencer, The Probabilistic Method [Russian translation], Binom, Laboratoriya Znanii, Moscow (2007).

    Google Scholar 

  7. L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, Part 1, Department of Computer Science, The University of Chicago, Preliminary version 2, September 1992.

  8. R. Bellman, Introduction to Matrix Theory [Russian translation], Nauka, Moscow (1969).

    Google Scholar 

  9. B. Bollob´as, Random Graphs, Second Edition, Cambridge Univ. Press (2001).

  10. V. G. Boltyanskii and I. Ts. Gokhberg, Theorems and Problems of Combinatorial Geometry [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  11. V. G. Boltyanskii, H. Martini, and P. S. Soltan, Excursions into Combinatorial Geometry, Universitext, Springer, Berlin (1997).

    Google Scholar 

  12. K. Borsuk, “Drei S¨atze ¨uber die n-dimensionale euklidische Sph¨are”, Fundam. Math., 20 , 177–190 (1933).

    Google Scholar 

  13. J. Bourgain and J. Lindenstrauss, “On covering a set in R d by balls of the same diameter,” In: Geometric Aspects of Functional Analysis, Lect. Notes Math., 1469, Springer-Verlag, Berlin (1991), pp. 138–144.

    Chapter  Google Scholar 

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

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

    MATH  Google Scholar 

  16. J. Cibulka, “On the chromatic number of real and rational spaces,” Combinatorics, 18, No. 2, 53–66 (2008).

    MATH  MathSciNet  Google Scholar 

  17. D. Cvetkovicz, M. Doob, and H. Zachs, Spectra of Graphs: Theory and Applications [Russian translation], Naukova Dumka, Kiev (1984).

    Google Scholar 

  18. M. Deza and P. Frankl, “Erdős–Ko–Rado theorem – 22 years later,” SIAM J. Alg. Disc. Methods, 4, 419–431 (1983).

    Article  MATH  MathSciNet  Google Scholar 

  19. P. Erdős, Ch. Ko, and R. Rado, “Intersection theorems for systems of finite sets,” J. Math. Oxford, Sec. 12 (48) (1961).

  20. P. Frankl and V. Rϒodl, “Forbidden intersections,” Trans. Amer. Math. Soc., 300, No. 1, 259–286 (1987).

    Article  MATH  MathSciNet  Google Scholar 

  21. P. Frankl and R. Wilson, “Intersection theorems with geometric consequences,” Combinatorics, 1, 357–368 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  22. E. S. Gorskaya, V. Yu. Protasov, A. M. Raigorodskii, and I. M. Shitova, “Estimates for chromatic numbers of spaces via convex optimization methods,” Mat. Sb. (2009) (in press).

  23. H. Hadwiger, “Ein ¨Uberdeckungssatz f¨ur den Euklidischen Raum,” Portug. Math., 4, 140–144 (1944).

    MATH  MathSciNet  Google Scholar 

  24. F. Harari, Graph Theory [Russian translation], Mir, Moscow (1973).

    Google Scholar 

  25. L. L. Ivanov, “Estimate for the chromatic number of space R4,” Usp. Mat. Nauk, 61, No. 5, 371–372 (2006).

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  27. R. Karp, Reducibility among Combinatorial Problems, Plenum Press, New York (1972).

    Google Scholar 

  28. V. Klee and S. Wagon, Old and New Unsolved Problems in Plane Geometry and Number Theory, American Mathematical Society (1991).

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

    Article  MATH  MathSciNet  Google Scholar 

  30. J. Matoušek, Using the Borsuk–Ulam Theorem, Universitext, Springer, Berlin (2003).

    MATH  Google Scholar 

  31. B. Parlett, Symmetric Eigenvalue Problem. Numerical Methods [Russian translation], Mir, Moscow (1983)

    MATH  Google Scholar 

  32. A. M. Raigorodskii, “The Borsuk problem and chromatic numbers of metric spaces,” Usp. Mat. Nauk, 56, No. 1, 107–146.

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

    Google Scholar 

  34. A. M. Raigorodskii, Chromatic Numbers [in Russian], MTsNMO, Moscow (2003).

    Google Scholar 

  35. L.A. Sz´ekely, “Erdős on unit distances and the Szemer´edi–Trotter theorems,” In: Paul Erdős and His Mathematics, Bolyai Series J. Bolyai Math. Soc., 11, Budapest, Springer (2002), pp. 649–666.

  36. A. M. Raigorodskii, “On the Borsuk conjecture,” In: Progress in Science and Technology, Series on Contemporary Mathematics and Its Applications [in Russian], 23, All-Russian Institute for Scientific and Technical Information, Russian Academy of Sciences, Moscow (2007), pp. 147–164.

    Google Scholar 

  37. A. M. Raigorodskii, “Three lectures on the Borsuk partition problem,” In: London Mathematical Society Lecture Note Series, 347 (2007), pp. 202–248.

  38. A. M. Raigorodskii, “The Borsuk partition problem: Its seventieth anniversary,” Math. Intell., 26, 4–12 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  39. A. M. Raigorodskii, The Borsuk Problem [in Russian], MTsNMO, Moscow (2006).

    Google Scholar 

  40. A. M. Raigorodskii, “On lower bounds for Borsuk and Hadwiger numbers,” Usp. Mat Nauk, 59, No. 3, 177–178 (2004).

    MathSciNet  Google Scholar 

  41. A. M. Raigorodskii, “On the relation between the Borsuk and Erdős–Hadwiger problems,” Usp. Mat. Nauk, 60, No. 4, 219–220 (2005).

    MathSciNet  Google Scholar 

  42. A. M. Raigorodskii, “On the Borsuk and Erdős–Hadwiger problems,” Mat. Zametki, 79, No. 6, 913–924 (2006).

    MathSciNet  Google Scholar 

  43. A. M. Raigorodskii, “On the chromatic number of space,” Usp. Mat. Nauk, 55, No. 2, 147–148 (2000).

    MathSciNet  Google Scholar 

  44. A. M. Raigorodskii, Probability and Algebra in Combinatorics [in Russian], MTsNMO, Moscow (2008).

    Google Scholar 

  45. A. M. Raigorodskii, “Some problems in combinatorial geometry, and the linear algebra method in combinatorics,” Chebyshev Sb., 7, No. 3 (19), 168–189 (2006) .

    MATH  MathSciNet  Google Scholar 

  46. A. M. Raigorodskii, “The Borsuk and Hadwiger problems with forbidden inner products,” Usp. Mat. Nauk, 57, No. 3, 159–160 (2002).

    MathSciNet  Google Scholar 

  47. A. M. Raigorodskii, “On dimension in the Borsuk problem,” Usp. Mat. Nauk, 52, No. 6, 181–182 (1997).

    MathSciNet  Google Scholar 

  48. A. M. Raigorodskii, Systems of General Representatives in Combinatorics and Their Applications to Geometry, MTsNMO, Moscow (2009).

    Google Scholar 

  49. A. M. Raigorodskii and M. M. Kityaev, “On a series of problems related to Borsuk and Nelson–Erdős–Hadwiger problems,” Mat. Zametki, 84, No. 2, 254–272 (2008).

    MathSciNet  Google Scholar 

  50. A. M. Raigorodskii and I. M. Shitova, “On the chromatic number of Euclidean space and the Borsuk problem,” Mat. Zametki, 83, No. 4, 636–639 (2008).

    MathSciNet  Google Scholar 

  51. A. M. Raigorodskii and I. M Shitova, “On chromatic numbers of real and rational spaces with several real or several rational forbidden distances,” Mat. Sb., 199, No. 4, 107–142 (2008).

    MathSciNet  Google Scholar 

  52. O. Schramm, “Illuminating sets of constant width,” Mathematika, 35, 180–189 (1988).

    Article  MATH  MathSciNet  Google Scholar 

  53. I. M. Shitova “On chromatic numbers of metric spaces with two forbidden distances,” Dokl. Ross. Akad. Nauk, 413, No. 2, 178–180 (2007).

    MathSciNet  Google Scholar 

  54. A. Soifer, “Plane chromatic number; its past, present, and future,” Mat. Prosveshchenie, No. 8 (2004).

  55. A. Soifer, “Chromatic number of the plane: a historical essay,” Combinatorics, 13–15 (1991).

  56. V. E. Tarakanov, Combinatorial Problems and (0, 1)-Matrices [in Russian], Nauka, Moscow (1985).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, Russia

    A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii & S. A. Usachev

Authors
  1. A. E. Guterman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. K. Lyubimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. M. Raigorodskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. A. Usachev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 65, Mathematical Physics, Combinatorics, and Optimal Control, 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guterman, A.E., Lyubimov, V.K., Raigorodskii, A.M. et al. On independence numbers of distance graphs with vertices in {-1,0,1}n: estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem. J Math Sci 165, 689–709 (2010). https://doi.org/10.1007/s10958-010-9835-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-010-9835-y

Keywords

Search

Navigation