|
Fundamentalnaya i Prikladnaya Matematika, 2005, Volume 11, Issue 6, Pages 131–141
(Mi fpm890)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Colorings of spaces, and random graphs
A. M. Raigorodskii M. V. Lomonosov Moscow State University
Abstract:
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.
Citation:
A. M. Raigorodskii, “Colorings of spaces, and random graphs”, Fundam. Prikl. Mat., 11:6 (2005), 131–141; J. Math. Sci., 146:2 (2007), 5723–5730
Linking options:
https://www.mathnet.ru/eng/fpm890 https://www.mathnet.ru/eng/fpm/v11/i6/p131
|
Statistics & downloads: |
Abstract page: | 521 | Full-text PDF : | 230 | References: | 36 | First page: | 1 |
|