On embedding of finite distance graphs with large chromatic number in random graphs
type: Item
instance of: scholarly article
title: On embedding of finite distance graphs with large chromatic number in random graphs
zbMATH Open document ID: 1201.05083
author: S. V. Nagaeva
author: Andrei M. Raigorodskii
published in: Journal of Mathematical Sciences (New York)
publication date: 2010-02-19T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5673495
MaRDI profile type: Publication
full work available at URL: s10958-009-9594-9
OpenAlex ID: W1995671315
cites work: Q5808059
cites work: A 15-colouring of 3-space omitting distance one
cites work: The realization of distances within sets in Euclidean space
cites work: Q3848394
cites work: On the space chromatic number
cites work: Borsuk's problem and the chromatic numbers of some metric spaces
cites work: The Nelson-Erdős-Hadwiger problem and embeddings of random graphs into geometric ones
cites work: The Nelson-Erdős-Hadwiger problem and a space realization of a random graph
DOI: 10.1007/S10958-009-9594-9
description: scientific article; zbMATH DE number 5673495