Distance graphs with large chromatic number and without large cliques
type: Item
instance of: scholarly article
title: Distance graphs with large chromatic number and without large cliques
zbMATH Open document ID: 1206.05037
DOI: 10.1134/S0001434610030119
author: O. I. Rubanov
author: Andrei M. Raigorodskii
published in: Mathematical Notes
publication date: 2010-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5791062
zbMATH Keywords: distance graph
zbMATH Keywords: chromatic number
zbMATH Keywords: clique
zbMATH Keywords: Stirling's formula
zbMATH Keywords: Euclidean space
zbMATH Keywords: probability space
zbMATH Keywords: random variable
zbMATH Keywords: expectation
MaRDI profile type: Publication
cites work: Borsuk's problem and the chromatic numbers of some metric spaces
cites work: On Ramsey Type Problems in Combinatorial Geometry
cites work: Research Problems in Discrete Geometry
cites work: The realization of distances within sets in Euclidean space
cites work: Q5808059
cites work: On the space chromatic number
cites work: On the chromatic number of a space
cites work: Q3208683
cites work: Q4876684
cites work: Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
description: scientific article; zbMATH DE number 5791062