On the chromatic number of a space with two forbidden distances

DOI10.1134/S1064562406030276zbMATH Open1327.05121OpenAlexW2029811448MaRDI QIDQ492399FDOQ492399

Authors: 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

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

Cites Work

• The realization of distances within sets in Euclidean space

Cited In (4)

• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• 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\)
• Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492399)