On the chromatic number of a space with two forbidden distances

DOI10.1134/S1064562406030276zbMath1327.05121OpenAlexW2029811448MaRDI QIDQ492399

Andrei M. Raigorodskii

Publication date: 20 August 2015

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562406030276

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (4)

Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections ⋮ Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\) ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ New lower bound for the chromatic number of a rational space with one and two forbidden distances

Cites Work

• The realization of distances within sets in Euclidean space

This page was built for publication: On the chromatic number of a space with two forbidden distances