Skip to main content
SpringerLink
Log in

Estimate of the Number of Edges in Special Subgraphs of a Distance Graph

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

The classical problem of estimating the number of edges in a subgraph of a special distance graph is considered. Old results are significantly improved.

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, “Cliques and cycles in distance graphs and graphs of diameters,” in Discrete Geometry and Algebraic Combinatorics, Contemp. Math. (Amer. Math. Soc., Providence, RI, 2014), Vol. 625, pp. 93–109.

    Google Scholar 

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

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

    Article  MathSciNet  MATH  Google Scholar 

  4. A. M. Raigorodskii, Russian Math. Surveys 56 (1), 103–139 (2001).

    Article  MathSciNet  Google Scholar 

  5. A. M. Raigorodskii, “On the chromatic numbers of spheres in Euclidean spaces,” Dokl. Akad. Nauk 432 (2), 174–177 (2010).

    MathSciNet  MATH  Google Scholar 

  6. A. M. Raigorodskii, Dokl. Math. 81 (3), 379–382 (2010).

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. J. Balogh, A. V. Kostochka, and A. M. Raigorodskii, “Coloring some finite sets in Rn,” Discuss. Math. Graph Theory 33 (1), 25–31 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  9. L. I. Bogolyubskii, A. S. Gusev, M. M. Pyaderkin, and A. M. Raigorodskii, “Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs,” Dokl. Akad. Nauk 457 (4), 383–387 (2014).

    MathSciNet  MATH  Google Scholar 

  10. L. I. Bogolyubskii, A. S. Gusev, M. M. Pyaderkin, and A. M. Raigorodskii, Dokl. Math. 90 (1), 462–465 (2014).

    Article  MathSciNet  Google Scholar 

  11. L. I. Bogolyubskii, A. S. Gusev, M. M. Pyaderkin, and A. M. Raigorodskii, “Independence numbers and chromatic numbers of the random subgraphs of some distance graphs,” Mat. Sb. 206 (10), 3–36 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  12. L. I. Bogolyubskii, A. S. Gusev, M. M. Pyaderkin, and A. M. Raigorodskii, Sb. Math. 206 (10), 1340–1374 (2015).

    Article  MathSciNet  Google Scholar 

  13. L. I. Bogolyubskii and A. M. Raigorodskii, “A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics ℓ1 and ℓ2,” Mat. Zametki 105 (2), 187–213 (2019).

    Article  MathSciNet  Google Scholar 

  14. L. I. Bogolyubskii and A. M. Raigorodskii, Math. Notes 105 (2), 180–203 (2019).

    Article  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  16. L. A. Székely, “Erdos on 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., Budapest, 2002), pp. 649–666.

    Google Scholar 

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

    Book  MATH  Google Scholar 

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

    MATH  Google Scholar 

  19. M. M. Pyaderkin, “Independence numbers of random subgraphs of a distance graph,” Mat. Zametki 99 (2), 288–297 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  20. M. M. Pyaderkin, Math. Notes 99 (2), 312–319 (2016).

    Article  MathSciNet  Google Scholar 

  21. D. D. Cherkashin and A. M. Raigorodskii, “On the chromatic numbers of low-dimensional spaces,” Dokl. Akad. Nauk 472 (1), 11–12 (2017).

    MATH  Google Scholar 

  22. D. D. Cherkashin and A. M. Raigorodskii, Dokl. Math. 95 (1), 5–6 (2017).

    Article  MathSciNet  Google Scholar 

  23. D. Cherkashin, A. Kulikov, and A. Raigorodskii, “On the chromatic numbers of small-dimensional Euclidean spaces,” Discrete Appl. Math. 243, 125–131 (2018).

    Article  MathSciNet  MATH  Google Scholar 

  24. R. I. Prosanov, A. A. Sagdeev, and A. M. Raigorodskii, “Improvements of the Frankl-Rödl theorem and geometric consequences,” Dokl. Akad. Nauk 475 (2), 137–139 (2017).

    MATH  Google Scholar 

  25. R. I. Prosanov, A. A. Sagdeev, and A. M. Raigorodskii, Dokl. Math. Dokl. Akad. Nauk 96 (1), 336–338 (2017).

    MathSciNet  Google Scholar 

  26. A. A. Sagdeev and A. M. Raigorodskii, “On the chromatic number of a space with a forbidden regular simplex,” Dokl. Akad. Nauk 472 (2), 127–129 (2017).

    MathSciNet  MATH  Google Scholar 

  27. A. A. Sagdeev and A. M. Raigorodskii, Dokl. Math. 95 (1), 15–16 (2017).

    Article  MathSciNet  Google Scholar 

  28. A. M. Raigorodskii and A. A. Sagdeev, “On a bound in extremal combinatorics,” Dokl. Akad. Nauk 478 (3), 271–273 (2018).

    MathSciNet  MATH  Google Scholar 

  29. A. M. Raigorodskii and A. A. Sagdeev, Dokl. Math. 97 (1), 47–48 (2018).

    Article  MathSciNet  Google Scholar 

  30. A. M. Raigorodskii and A. A. Sagdeev, “On a Frankl-Wilson theorem and its geometric corollaries,” Acta Math. Univ. Comenianae 88 (3), 1029–1033 (2019), http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1216/758.

    MathSciNet  Google Scholar 

  31. A. A. Sagdeev, “On the Frankl-Rödl theorem,” Izv. Ross. Akad. Nauk Ser. Mat. 82 (6), 128–157 (2018).

    MathSciNet  MATH  Google Scholar 

  32. A. A. Sagdeev, Izv. Math. 82 (6), 1196–1224 (2018).

    Article  MathSciNet  Google Scholar 

  33. A. A. Sagdeev, “Exponentially Ramsey sets,” Problemy Peredachi Informatsii 54 (4), 82–109 (2018).

    MathSciNet  MATH  Google Scholar 

  34. A. A. Sagdeev, Probl. Inform. Transm. 54 (4), 372–396 (2018).

    Article  Google Scholar 

  35. A. A. Sagdeev, “Improved Frankl-Rödl theorem and some of its geometric consequences,” Problemy Peredachi Informatsii 54 (2), 45–72 (2018).

    MathSciNet  MATH  Google Scholar 

  36. A. A. Sagdeev, Probl. Inform. Transm. 54 (2), 130–164 (2018).

    Google Scholar 

  37. N. D. Filonov, “Number of nonzero cubic sums,” in Zap. Nauchn. Sem. St.-Peterburg. Otdel. Mat. Inst. Steklov (POMI), Vol. 469: Algebra and Number Theory. 1 (POMI, St. Petersburg., 2018), pp. 160–174.

    Google Scholar 

  38. N. D. Filonov, J. Math. Sci. (New York) 242 (4), 575–585 (2019).

    Article  MathSciNet  Google Scholar 

  39. D. A. Zakharov and A. M. Raigorodskii, “Clique chromatic numbers of intersection graphs,” Mat. Zametki 105 (1), 142–144 (2019).

    Article  MathSciNet  MATH  Google Scholar 

  40. D. A. Zakharov and A. M. Raigorodskii, Math. Notes 105 (1), 137–139 (2019).

    Article  MathSciNet  Google Scholar 

  41. A. M. Raigorodskii and T. V. Trukhan, “On the chromatic numbers of some distance graphs,” Dokl. Akad. Nauk 482 (6), 648–650 (2018).

    MATH  Google Scholar 

  42. A. M. Raigorodskii and T. V. Trukhan, Dokl. Math. 98 (2), 515–517 (2018).

    Article  Google Scholar 

  43. L. E. Shabanov and A. M. Raigorodskii, “Turan-type bounds for distance graphs,” Dokl. Akad. Nauk 475 (3), 254–256 (2017).

    MATH  Google Scholar 

  44. L. E. Shabanov and A. M. Raigorodskii, Dokl. Math. 96 (1), 351–353 (2017).

    Article  MathSciNet  Google Scholar 

  45. L. E. Shabanov and A. M. Raigorodskii, “Turán type results for distance graphs,” Discrete Comput. Geom. 56 (3), 814–832 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  46. L. É. Shabanov, “Turán-type results for distance graphs in an infinitesimal plane layer,” in Zap. Nauchn. Sem. St.-Peterburg. Otdel. Mat. Inst. Steklov (POMI), Vol. 464: Combinatorics and Theory of Graphs. IX (POMI, St. Petersburg., 2017), pp. 132–168.

    Google Scholar 

  47. L. É. Shabanov, J. Math. Sci. (New York) 236 (5), 554–578 (2019).

    Article  MathSciNet  Google Scholar 

  48. M. Tikhomirov, “On the distance and multidistance graph embeddability problem,” Dokl. Akad. Nauk 468 (3), 261–263 (2016).

    MATH  Google Scholar 

  49. M. Tikhomirov, Dokl. Math. 93 (3), 280–281 (2016).

    Article  MathSciNet  Google Scholar 

  50. M. Tikhomirov, “On complexity of multidistance graph recognition in ℝ1,” Electron. Notes Discrete Math. 61, 1039–1045 (2017).

    Article  MATH  Google Scholar 

  51. N. Frankl, A. Kupavskii, and K. J. Swanepoel, “Embedding graphs in Euclidean space,” Electron. Notes Discrete Math. 61, 475–481 (2017).

    Article  MATH  Google Scholar 

  52. A. V. Bobu, A. É. Kupriyanov and A. M. Raigorodskii, “On the number of edges in a uniform hypergraph with a range of permitted intersections,” Dokl. Akad. Nauk 475 (4), 365–368 (2017).

    MATH  Google Scholar 

  53. A. V. Bobu, A. É. Kupriyanov and A. M. Raigorodskii, Dokl. Math. 96 (1), 354–357 (2017).

    Article  MathSciNet  Google Scholar 

  54. A. V. Bobu, A. É. Kupriyanov, and A. M. Raigorodskii, “On the number of edges of a uniform hypergraph with a range of allowed intersections,” Problemy Peredachi Informatsii 53 (4), 16–42 (2017).

    MathSciNet  MATH  Google Scholar 

  55. A. V. Bobu, A. É. Kupriyanov, and A. M. Raigorodskii, Probl. Inform. Transm. 53 (4), 319–342 (2017).

    Article  Google Scholar 

  56. A. V. Bobu and A. É. Kupriyanov, “Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles,” Mat. Zametki 105 (3), 349–363 (2019).

    Article  MathSciNet  MATH  Google Scholar 

  57. A. V. Bobu and A. É. Kupriyanov, Math. Notes 105 (3), 329–341 (2019).

    Article  MathSciNet  Google Scholar 

  58. S. G. Kiselevand A. M. Raigorodskii, “On the chromatic number of a random subgraph of the Kneser graph,” Dokl. Akad. Nauk 476 (4), 375–376 (2017).

    MathSciNet  Google Scholar 

  59. S. G. Kiselevand A. M. Raigorodskii, Dokl. Math. 96 (2), 475–476 (2017).

    Article  MathSciNet  Google Scholar 

  60. J. Balogh, D. Cherkashin, and S. Kiselev, “Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs,” European J. Combin. 79, 228–236 (2019).

    Article  MathSciNet  MATH  Google Scholar 

  61. A. M. Raigorodskii, “On the stability of the independence number of a random subgraph,” Dokl. Akad. Nauk 477 (6), 649–651 (2017).

    MathSciNet  Google Scholar 

  62. A. M. Raigorodskii, Dokl. Math. 96 (3), 628–630 (2017).

    Article  MathSciNet  Google Scholar 

  63. V. Boltyanski, H. Martini, and P. S. Soltan, Excursions into Combinatorial Geometry (Springer-Verlag, Berlin, 1997).

    Book  MATH  Google Scholar 

  64. A. M. Raigorodskii, “Three lectures on the Borsuk partition problem,” in Surveys in Contemporary Mathematics, London Math. Soc. Lecture Note Ser. (Cambridge Univ. Press, Cambridge, 2007), Vol. 347, pp. 202–248.

    Chapter  Google Scholar 

  65. A. M. Raigorodskii, “Around Borsuk’s hypothesis,” in Sovrem. Mat., Fundam. Napravl., Vol. 23: Geometry and Mechanics (RUDN, Moscow, 2007), pp. 147–164.

    Google Scholar 

  66. A. M. Raigorodskii, J. Math. Sci. (New York) 154 (4), 604–623 (2008).

    Article  MathSciNet  Google Scholar 

  67. R. I. Prosanov, “Counterexamples to Borsuk’s conjecture with large girth,” Mat. Zametki 105 (6), 890–898 (2019).

    Article  MathSciNet  MATH  Google Scholar 

  68. R. I. Prosanov, Math. Notes 105 (6), 874–880 (2019).

    Article  MathSciNet  Google Scholar 

  69. R. L. Graham, B. L. Rothschild, and J. H. Spencer, Ramsey Theory (John Wiley and Sons, New York, 1990).

    MATH  Google Scholar 

  70. Z. Nagy, “A certain constructive estimate of the Ramsey number,” Mat. Lapok 23 (301–302), 26 (1972).

    MathSciNet  Google Scholar 

  71. E. E. Demekhin, A. M. Raigorodskii, and O. I. Rubanov, “Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size,” Mat. Sb. 204 (4), 49–78 (2013).

    Article  MATH  Google Scholar 

  72. E. E. Demekhin, A. M. Raigorodskii, and O. I. Rubanov, Sb. Math. 204 (4), 508–538 (2013).

    Article  MathSciNet  Google Scholar 

  73. A. M. Raigorodskii and K. A. Mikhailov, “On the Ramsey numbers for complete distance graphs with vertices in {0,1}n,” Mat. Sb. 200 (12), 63–80 (2009).

    Article  MathSciNet  Google Scholar 

  74. A. M. Raigorodskii and K. A. Mikhailov, Sb. Math. 200 (12), 1789–1806 (2009).

    Article  MathSciNet  Google Scholar 

  75. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (Radio i Svyaz’, Moscow, 1979) [Russian transl.].

    MATH  Google Scholar 

  76. L. Bassalygo, G. Cohen, and G. Zemor, “Codes with forbidden distances,” Discrete Math. 213 (1–3), 3–11 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  77. A. M. Raigorodskii, “Combinatorial geometry and coding theory,” Fund. Inform. 145 (3), 359–369 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  78. F. A. Pushnyakov, “On the number of edges in induced subgraphs of a special distance graph,” Mat. Zametki 99 (4), 550–558 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  79. F. A. Pushnyakov, Math. Notes 99 (4), 545–551 (2016).

    Article  MathSciNet  Google Scholar 

  80. F. A. Pushnyakov, “A new estimate for the number of edges in induced subgraphs of a special distance graph,” Problemy Peredachi Informatsii 51 (4), 71–77 (2015).

    MathSciNet  MATH  Google Scholar 

  81. F. A. Pushnyakov, Probl. Inform. Transm. 51 (4), 371–377 (2015).

    Article  MathSciNet  Google Scholar 

  82. F. A. Pushnyakov, “The number of edges in induced subgraphs of some distance graphs,” Mat. Zametki 105 (4), 592–602 (2019).

    Article  MathSciNet  MATH  Google Scholar 

  83. F. A. Pushnyakov, Math. Notes 105 (4), 582–591 (2019).

    Article  MathSciNet  Google Scholar 

  84. A. V. Bobu, A. E. Kupriyanov, and A. M. Raigorodskii, “On chromatic numbers of nearly Kneser distance graphs,” Dokl. Akad. Nauk 468 (3), 247–250 (2016).

    MATH  Google Scholar 

  85. A. V. Bobu, A. E. Kupriyanov, and A. M. Raigorodskii, Dokl. Math. 93 (3), 267–269 (2016).

    Article  MathSciNet  Google Scholar 

  86. A. V. Bobu, A. É. Kupriyanov, and A. M. Raigorodskii, “On the maximal number of edges in a uniform hypergraph with one forbidden intersection,” Dokl. Akad. Nauk 463 (1), 11–13 (2015).

    MATH  Google Scholar 

  87. A. V. Bobu, A. É. Kupriyanov, and A. M. Raigorodskii, Dokl. Math. 92 (1), 401–403 (2015).

    Article  MathSciNet  Google Scholar 

  88. A. V. Bobu, A. É. Kupriyanov, and A. M. Raigorodskii, “Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection,” Mat. Sb. 207 (5), 17–42 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  89. A. V. Bobu, A. É. Kupriyanov, and A. M. Raigorodskii, Sb. Math. 207 (5), 652–677 (2016).

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work was supported by the Russian Foundation for Basic Research under grant 18-01-00355 and by the program “Leading Scientific Schools” under grant NSh-6760.2018.1.

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology (State University), Dolgoprudnyi, Moscow Oblast, 141701, Russia

    F. A. Pushnyakov & A. M. Raigorodskii

  2. Lomonosov Moscow State University, Moscow, 119991, Russia

    A. M. Raigorodskii

  3. Caucasus Mathematical Center, Adyghe State University, Maikop, 352700, Russia

    A. M. Raigorodskii

  4. Institute for Mathematics and Informatics, Buryat State University, Ulan-Ude, 670000, Russia

    A. M. Raigorodskii

Authors
  1. F. A. Pushnyakov
    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 authors

Correspondence to F. A. Pushnyakov or A. M. Raigorodskii.

Additional information

Russian Text © The Author(s), 2020, published in Matematicheskie Zametki, 2020, Vol. 107, No. 2, pp. 286–298.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pushnyakov, F.A., Raigorodskii, A.M. Estimate of the Number of Edges in Special Subgraphs of a Distance Graph. Math Notes 107, 322–332 (2020). https://doi.org/10.1134/S0001434620010320

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation