1. A. M. Raigorodskii, T. V. Trukhan, “On the chromatic numbers of some distance graphs”, Dokl. Math., 98:2 (2018), 515–517  mathnet  crossref  crossref  zmath  isi  elib  scopus
  2. A. A. Sokolov, A. M. Raigorodskii, “O ratsionalnykh analogakh problem Nelsona–Khadvigera i Borsuka”, Chebyshevskii sb., 19:3 (2018), 270–281  mathnet  crossref  elib
  3. L. E. Shabanov, “Turán type results for distance graphs in infinitesimal plane layer”, J. Math. Sci. (N. Y.), 236:5 (2019), 554–578  mathnet  crossref
  4. S. N. Popova, “Zero-one law for random subgraphs of some distance graphs with vertices in $\mathbb Z^n$”, Sb. Math., 207:3 (2016), 458–478  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib
  5. S. N. Popova, “Zero-one laws for random graphs with vertices in a Boolean cube”, Siberian Adv. Math., 27:1 (2017), 26–75  mathnet  crossref  crossref  mathscinet  elib
  6. A. S. Gusev, “New Upper Bound for the Chromatic Numberof a Random Subgraph of a Distance Graph”, Math. Notes, 97:3 (2015), 326–332  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
  7. V. V. Utkin, “Hamiltonian Paths in Distance Graphs”, Math. Notes, 97:6 (2015), 919–929  mathnet  crossref  crossref  mathscinet  isi  elib
  8. A. V. Bobu, O. A. Kostina, A. E. Kupriyanov, “Independence numbers and chromatic numbers of some distance graphs”, Problems Inform. Transmission, 51:2 (2015), 165–176  mathnet  crossref  isi  elib
  9. L. I. Bogolubsky, A. S. Gusev, M. M. Pyaderkin, A. M. Raigorodskii, “Independence numbers and chromatic numbers of the random subgraphs of some distance graphs”, Sb. Math., 206:10 (2015), 1340–1374  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib
  10. A. V. Burkin, “Small subgraphs in random distance graphs”, Theory Probab. Appl., 60:3 (2016), 367–382  mathnet  crossref  crossref  mathscinet  isi  elib
  11. Pyaderkin M.M., “on the Stability of the Erdos-Ko-Rado Theorem”, Dokl. Math., 91:3 (2015), 290–293  crossref  mathscinet  zmath  isi  elib
  12. A. V. Burkin, “The threshold probability for the property of planarity of a random subgraph of a regular graph”, Russian Math. Surveys, 70:6 (2015), 1170–1172  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
  13. A. A. Kokotkin, “On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number”, Math. Notes, 96:2 (2014), 298–300  mathnet  crossref  mathscinet  zmath  isi  elib
  14. Andrei Aleksandrovich Kokotkin, Andrey ALeksandrovich Kokotkin, “O bolshikh podgrafakh grafa rasstoyanii, imeyuschikh malenkoe khromaticheskoe chislo”, Matematicheskie zametki, 96:2 (2014), 318  crossref
  15. A. B. Kupavskii, A. M. Raigorodskii, “Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii”, Sb. Math., 204:10 (2013), 1435–1479  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
  16. Andrei M. Raigorodskii, Thirty Essays on Geometric Graph Theory, 2013, 429  crossref
  17. N. G. Moshchevitin, “Density modulo 1 of lacunary and sublacunary sequences: application of Peres–Schlag's construction”, J. Math. Sci., 180:5 (2012), 610–625  mathnet  crossref  mathscinet  elib
  18. A. M. Raigorodskii, I. M. Shitova, “Chromatic numbers of real and rational spaces with real or rational forbidden distances”, Sb. Math., 199:4 (2008), 579–612  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
  19. A. M. Raigorodskii, “Around Borsuk's Hypothesis”, Journal of Mathematical Sciences, 154:4 (2008), 604–623  mathnet  crossref  mathscinet  zmath  elib
  20. A. M. Raigorodskii, “Chromatic Numbers of Metric Spaces”, Journal of Mathematical Sciences, 154:4 (2008), 624–627  mathnet  crossref  mathscinet  zmath  elib
1
2
Next