New lower bound for the chromatic number of a rational space with one and two forbidden distances
From MaRDI portal
Publication:2353733
Recommendations
- A new lower bound for the chromatic number of the rational space
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
- On the chromatic numbers of metric spaces with few forbidden distances
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- On the Chromatic Numbers of and with Intervals of Forbidden Distances
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
Cites work
- scientific article; zbMATH DE number 5935733 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 1406330 (Why is no real title available?)
- Borsuk's problem and the chromatic numbers of some metric spaces
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Coloring distance graphs and graphs of diameters
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- On the chromatic number of a space
- On the chromatic number of a space with two forbidden distances
- On the chromatic number of with an arbitrary norm
- Research Problems in Discrete Geometry
- The Mathematical Coloring Book
- The realization of distances within sets in Euclidean space
Cited in
(12)- Isomorphism classes of distance graphs in \(\mathbb{Q}^3\)
- Turán-type bounds for distance graphs
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
- 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\)
- On the chromatic number of an infinitesimal plane layer
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- On a bound in extremal combinatorics
- On the chromatic numbers of rational spaces
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
This page was built for publication: New lower bound for the chromatic number of a rational space with one and two forbidden distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353733)
