Embeddability of finite distance graphs with a large chromatic number in random graphs
type: Item
instance of: scholarly article
title: Embeddability of finite distance graphs with a large chromatic number in random graphs
zbMATH Open document ID: 1194.05026
DOI: 10.1134/S1064562408010043
author: S. V. Nagaeva
published in: Doklady Mathematics
publication date: 2009-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5485358
zbMATH Keywords: Nelson-Erdoes-Hadwiger problem
zbMATH Keywords: chromatic number of Euclidean space
zbMATH Keywords: complete distance graph
MaRDI profile type: Publication
cites work: On the space chromatic number
cites work: A 15-colouring of 3-space omitting distance one
cites work: The realization of distances within sets in Euclidean space
description: scientific article; zbMATH DE number 5485358