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

DOI10.1134/S0001434616050151MaRDI QIDQ325532zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
• Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
• The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
• Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
• Chromatic numbers of real and rational spaces with real or rational forbidden distances

Cites work

• scientific article; zbMATH DE number 5935733 (Why is no real title available?)
• Borsuk's problem and the chromatic numbers of some metric spaces
• Colorings of the space \(\mathbb R^{n}\) with several forbidden distances

Cited in

(21)

• Estimating the chromatic numbers of Euclidean space by convex minimization methods
• Turán-type bounds for distance graphs
• Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
• Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
• Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
• New lower bounds for the chromatic number of a space with forbidden isosceles triangles
• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• Chromatic numbers of distance graphs without short odd cycles in rational spaces
• Yet another species of forbidden-distances chromatic number
• On the chromatic numbers corresponding to exponentially Ramsey sets
• Distance graphs with large chromatic number and without cliques of given size in the rational space
• On the chromatic number for a set of metric spaces
• Chromatic numbers of spheres
• The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
• Chromatic numbers of real and rational spaces with real or rational forbidden distances
• On upper bounds for the multi-fold chromatic numbers of the plane
• Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
• Chromatic numbers of metric spaces
• Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
• On the number of edges of a uniform hypergraph with a range of allowed intersections

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

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