On the chromatic number of Euclidean space with two forbidden distances
From MaRDI portal
Publication:2343924
DOI10.1134/S0001434614110182zbMath1408.05057MaRDI QIDQ2343924
Alexey V. Berdnikov, Andrei M. Raigorodskii
Publication date: 11 May 2015
Published in: Mathematical Notes (Search for Journal in Brave)
Euclidean spaceindependence numberindependent setchromatic numberasymptotic boundsdistance graphsforbidden distance
Metric spaces, metrizability (54E35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of spheres ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
Cites Work
This page was built for publication: On the chromatic number of Euclidean space with two forbidden distances
