Distance Graphs with Large Chromatic Numbers and Small Clique Numbers

被引：5

作者：

Kupavskii, A. B. ^{[1
]}

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

机构：

[1] Moscow Inst Phys & Technol Tech Univ, Dolgoprudnyi 141700, Moscow Oblast, Russia

[2] Moscow MV Lomonosov State Univ, Fac Mech & Math, Moscow 119992, Russia

来源：

基金：

俄罗斯基础研究基金会;

关键词：

SPACE;

D O I：

10.1134/S1064562412030295

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：394 / 398

页数：5

共 13 条

[1] [Anonymous], PROBABILISTIC METHOD
[2] [Anonymous], 2009, NUMBER THEORY APPL, DOI DOI 10.1007/978-93-86279-46-0_11
[3] BRASS P, 2005, RES PROBLEMS DISCRET, DOI DOI 10.1007/0-387-29929-7
[4] Demekhin E. E., ARXIV12022968V1
[5] Erdos P., 1959, CAN J MATH, V11, P34
[6] INTERSECTION-THEOREMS WITH GEOMETRIC CONSEQUENCES
FRANKL, P
WILSON, RM
[J]. COMBINATORICA, 1981, 1 (04) : 357 - 368
[7] REALIZATION OF DISTANCES WITHIN SETS IN EUCLIDEAN SPACE
LARMAN, DG
ROGERS, CA
[J]. MATHEMATIKA, 1972, 19 (37) : 1 - &
[8] Pranhar K., 1957, PRIMZAHLVERTEILUNG
[9] On distance graphs with large chromatic number but without large simplices
Raigorodskii, A. M.
[J]. RUSSIAN MATHEMATICAL SURVEYS, 2007, 62 (06) : 1224 - 1225
[10] Distance graphs with large chromatic number and without large cliques
Raigorodskii, A. M.
Rubanov, O. I.
[J]. MATHEMATICAL NOTES, 2010, 87 (3-4) : 392 - 402