|
|
Publications in Math-Net.Ru
-
Odd-distance sets and right-equidistant sequences in the maximum and Manhattan metrics
Dokl. RAN. Math. Inf. Proc. Upr., 506 (2022), 45–48
-
Infinite sets can be Ramsey in the Chebyshev metric
Uspekhi Mat. Nauk, 77:3(465) (2022), 175–176
-
Ramsey theory in the $n$-space with Chebyshev metric
Uspekhi Mat. Nauk, 75:5(455) (2020), 191–192
-
Colourings of uniform hypergraphs with large girth and applications
Comb. Probab. Comput., 27:2 (2018), 245–273
-
On Simplices in Diameter Graphs in $\mathbb R^4$
Mat. Zametki, 101:2 (2017), 232–246
-
On Schur's Conjecture in $\mathbb R^4$
Mat. Zametki, 97:1 (2015), 23–34
-
Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
Izv. RAN. Ser. Mat., 78:1 (2014), 65–98
-
Colorings of partial Steiner systems and their applications
Fundam. Prikl. Mat., 18:3 (2013), 77–115
-
The distribution of second degrees in the Buckley–Osthus random graph model
Internet Math., 9:4 (2013), 297–335
-
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
Mat. Sb., 204:10 (2013), 47–90
-
Colorings of uniform hypergraphs with large girth
Dokl. Akad. Nauk, 443:4 (2012), 422–426
-
On the colouring of spheres embedded in $\mathbb R^n$
Mat. Sb., 202:6 (2011), 83–110
-
Partition of Three-Dimensional Sets into Five Parts of Smaller Diameter
Mat. Zametki, 87:2 (2010), 233–245
-
On the chromatic number of $\mathbb R^9$
Fundam. Prikl. Mat., 14:5 (2008), 139–154
-
Дискретный анализ для математиков и программистов (подборка задач)
Mat. Pros., Ser. 3, 17 (2013), 162–181
© , 2025