Colorings of spaces, and random graphs
Fundamentalʹnaâ i prikladnaâ matematika, Tome 11 (2005) no. 6, pp. 131-141
Voir la notice de l'article provenant de la source Math-Net.Ru
This work deals with some problems on the embeddings of finite geometric graphs into the random ones. In particular, we study here applications of the random graph theory to the Nelson–Erdös–Hadwiger problem on coloring spaces.
@article{FPM_2005_11_6_a12,
author = {A. M. Raigorodskii},
title = {Colorings of spaces, and random graphs},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {131--141},
publisher = {mathdoc},
volume = {11},
number = {6},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2005_11_6_a12/}
}
A. M. Raigorodskii. Colorings of spaces, and random graphs. Fundamentalʹnaâ i prikladnaâ matematika, Tome 11 (2005) no. 6, pp. 131-141. http://geodesic.mathdoc.fr/item/FPM_2005_11_6_a12/