Result 1 to 20 of 46 total
Distance graphs with large chromatic numbers and small clique numbers. (English)
Dokl. Math. 85, No. 3, 394-398 (2012); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 444, No. 5, 483-487 (2012).
1
On the chromatic numbers of spheres in $R^n$. (English)
Combinatorica 32, No. 1, 111-123 (2012).
2
The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems. (English)
Russ. Math. Surv. 66, No. 5, 933-1002 (2011); translation from Usp. Mat. Nauk. 66, No. 3, 109-182 (2011).
3
New lower bounds for the independence numbers of distance graphs with vertices in $\{-1,0,1\}^{n}$. (English)
Math. Notes 89, No. 2, 307-308 (2011); translation from Mat. Zametki 89, No. 2, 319-320 (2011).
4
Counterexamples to Borsuk’s conjecture on spheres of small radius. (English)
Dokl. Math. 82, No. 2, 719-721 (2010); translation from Dokl. Akad. Nauk., Ross. Akad. Nauk. 434, No. 2, 161-163 (2010).
5
On the chromatic numbers of spheres in Euclidean spaces. (English)
Dokl. Math. 81, No. 3, 379-382 (2010); translation from Dokl. Akad. Nauk., Ross. Akad. Nauk. 432, No. 2, 174-177 (2010).
6
Distance graphs with large chromatic number and without large cliques. (English)
Math. Notes 87, No. 3, 392-402 (2010); translation from Mat. Zametki 87, No. 3, 417-428 (2010).
7
On the realization of random graphs as distance graphs in spaces of fixed dimension. (English)
Dokl. Math. 79, No. 1, 63-65 (2009); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 424, No. 3, 315-317 (2009).
8
On the clique and the chromatic numbers of high-dimensional distance graphs. (English)
Adhikari, Sukumar Das (ed.) et al., Number theory and applications. Proceedings of the international conferences on number theory and cryptography, Allahabad, India, December 2006 and February 2007. New Delhi: Hindustan Book Agency (ISBN 978-81-85931-97-5/hbk). 149-155 (2009).
9
On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$. (English)
Sb. Math. 200, No. 12, 1789-1806 (2009); translation from Mat. Sb. 200, No. 12, 63-80 (2009).
10
On embedding of finite distance graphs with large chromatic number in random graphs. (English)
J. Math. Sci., New York 161, No. 5, 648-667 (2009); translation from Sovrem. Mat. Prilozh. 62 (2009).
11
On the independence number of distance graphs with vertices in $\{-1,0,1\}^n$. (English)
Math. Notes 86, No. 5, 744-746 (2009); translation from Mat. Zametki 86, No. 5, 794-796 (2009).
12
Lower bounds for the independence numbers of some distance graphs with vertices in $\{-1,0,1\}^n$. (English)
Dokl. Math. 80, No. 1, 547-549 (2009); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 427, No. 4, 458-460 (2009).
13
Estimating the chromatic numbers of Euclidean space by convex minimization methods. (English)
Sb. Math. 200, No. 6, 783-801 (2009); translation from Mat. Sb. 200, No. 6, 3-22 (2009).
14
Small clique and large chromatic number (English)
Electronic Notes in Discrete Mathematics 34, 441-445 (2009).
15
On the chromatic numbers of small-dimensional Euclidean spaces (English)
Electronic Notes in Discrete Mathematics 34, 435-439 (2009).
16
Chromatic numbers of real and rational spaces with real or rational forbidden distances. (English)
Sb. Math. 199, No. 4, 579-612 (2008); translation from Mat. Sb. 199, No. 4, 107-142 (2008).
17
Chromatic numbers of metric spaces. (English)
J. Math. Sci., New York 154, No. 4, 624-627 (2008); translation from Sovrem. Mat., Fundam. Napravl. 23, 165-168 (2007).
18
On the chromatic number of Euclidean space and the Borsuk problem. (English)
Math. Notes 83, No. 4, 579-582 (2008); translation from Mat. Zametki 83, No. 4, 636-639 (2008).
19
On a series of Ramsey-type problems in combinatorial geometry. (English)
Dokl. Math. 75, No. 2, 221-223 (2007); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 413, No. 2, 171-173 (2007).
20
Result 1 to 20 of 46 total
Start
Contact
Print
General Help
