Estimate for the chromatic number of Euclidean space with several forbidden distances

DOI10.1134/S0001434616050151zbMath1354.05043OpenAlexW2460875782MaRDI QIDQ325532

Alexey V. Berdnikov

Publication date: 18 October 2016

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

metric spaceindependence numberBertrand postulatechromatic number with forbidden distances

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (10)

Turán-type bounds for distance graphs ⋮ The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances ⋮ Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size ⋮ Chromatic numbers of spheres ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ 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

• Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
• Borsuk's problem and the chromatic numbers of some metric spaces
• Unnamed Item

This page was built for publication: Estimate for the chromatic number of Euclidean space with several forbidden distances