Embeddability of finite distance graphs with a large chromatic number in random graphs

被引：0

作者：

Department of Mathematical Statistics and Random Processes, Faculty of Mechanics and Mathematics, Moscow State University, Leninskie gory, Moscow 119992, Russia ^{[1
]}

机构：

来源：

Dokl. Math. | 2008年 / 1卷 / 13-16期

关键词：

(Edited Abstract);

D O I：

10.1134/s1064562408010043

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Embeddability of finite distance graphs with a large chromatic number in random graphs
S. V. Nagaeva
Doklady Mathematics, 2008, 77 : 13 - 16
[2] Embeddability of finite distance graphs with a large chromatic number in random graphs
Nagaeva, S. V.
DOKLADY MATHEMATICS, 2008, 77 (01) : 13 - 16
[3] On embedding of finite distance graphs with large chromatic number in random graphs
Nagaeva S.V.
Raigorodskii A.M.
Journal of Mathematical Sciences, 2009, 161 (5) : 648 - 667
[4] Distance graphs with finite chromatic number
Ruzsa, IZ
Tuza, Z
Voigt, M
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 85 (01) : 181 - 187
[5] Distance graphs with large chromatic number and without large cliques
Raigorodskii, A. M.
Rubanov, O. I.
MATHEMATICAL NOTES, 2010, 87 (3-4) : 392 - 402
[6] Distance graphs with large chromatic number and without large cliques
A. M. Raigorodskii
O. I. Rubanov
Mathematical Notes, 2010, 87 : 392 - 402
[7] On distance graphs with large chromatic number but without large simplices
Raigorodskii, A. M.
RUSSIAN MATHEMATICAL SURVEYS, 2007, 62 (06) : 1224 - 1225
[8] On the chromatic number of random graphs
Coja-Oghlan, Amin
Panagiotou, Konstantinos
Steger, Angelika
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2008, 98 (05) : 980 - 993
[9] THE CHROMATIC NUMBER OF RANDOM GRAPHS
LUCZAK, T
COMBINATORICA, 1991, 11 (01) : 45 - 54
[10] THE CHROMATIC NUMBER OF RANDOM GRAPHS
BOLLOBAS, B
COMBINATORICA, 1988, 8 (01) : 49 - 55

← 1 2 3 4 5 →