This article is cited 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.

UDC: 514.17+519.17

 English version: Journal of Mathematical Sciences (New York), 2007, 146:2, 5723–5730

Bibliographic databases:

• 
• 
• 
•