Geodesic
On the structure of distance graphs with large chromatic numbers
Matematičeskie zametki, Tome 80 (2006) no. 3, pp. 473-475

Voir la notice de l'article provenant de la source Math-Net.Ru

Keywords: chromatic number, distance graph, Nelson–Erdös–Hadwiger problem. 
@article{MZM_2006_80_3_a19,
     author = {A. M. Raigorodskii},
     title = {On the structure of distance graphs with large chromatic numbers},
     journal = {Matemati\v{c}eskie zametki},
     pages = {473--475},
     publisher = {mathdoc},
     volume = {80},
     number = {3},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2006_80_3_a19/}
}
TY  - JOUR
AU  - A. M. Raigorodskii
TI  - On the structure of distance graphs with large chromatic numbers
JO  - Matematičeskie zametki
PY  - 2006
SP  - 473
EP  - 475
VL  - 80
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2006_80_3_a19/
LA  - ru
ID  - MZM_2006_80_3_a19
ER  - 
%0 Journal Article
%A A. M. Raigorodskii
%T On the structure of distance graphs with large chromatic numbers
%J Matematičeskie zametki
%D 2006
%P 473-475
%V 80
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2006_80_3_a19/
%G ru
%F MZM_2006_80_3_a19
A. M. Raigorodskii. On the structure of distance graphs with large chromatic numbers. Matematičeskie zametki, Tome 80 (2006) no. 3, pp. 473-475. http://geodesic.mathdoc.fr/item/MZM_2006_80_3_a19/