On distance graphs with large chromatic number but without large simplices

被引：8

作者：

Raigorodskii, A. M. ^{[1
]}

机构：

[1] Moscow MV Lomonosov State Univ, Moscow, Russia

来源：

关键词：

D O I：

10.1070/RM2007v062n06ABEH004493

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：1224 / 1225

页数：2

共 13 条

[1]

Alon N., 2004, The probabilistic method

[2]

[Anonymous], 2001, CAMBRIDGE STUD ADV M

[3]

de Bruijn N.G., 1951, NEDERL AKAD WETENS A, V13, P369

[4]

Hadwiger H., 1961, ELEM MATH, V16, P103

[5]

Harary F., 1972, Graph Theory

[6] REALIZATION OF DISTANCES WITHIN SETS IN EUCLIDEAN SPACE [J].

LARMAN, DG ;

ROGERS, CA .

[7]

ODONNELL P, 1995, GEOMBINATORICS, V5, P31

[8]

ODONNELL P, 1994, GEOMBINATORICS, V4, P23

[9]

Raigorodskii A. M., 2007, LINEAR ALGEBRAIC MET

[10] On the chromatic number of a space [J].

Raigorodskii, AM .