On lower bounds for the chromatic number of sphere
From MaRDI portal
The last lower bound for the chromatic number of the unit distance graph, whose vertex set is a sphere of radius \(r\) in the \(n\)-dimensional Euclidean space is due to Raigorodskii, the second author of the paper under review. He showed that for any fixed \(r>\frac12\) the chromatic number grows exponentially with \(n\). His lower bound, however, did not depend on \(r\) for \(\frac{1}{\sqrt{2}}<r\). This paper provides improved lower bounds that do depend on \(r\) if \(\frac{1}{\sqrt{2}}<r<\frac{1}{\root{4}\of{2}}\).
Recommendations
Cites work
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- scientific article; zbMATH DE number 3845607 (Why is no real title available?)
- scientific article; zbMATH DE number 3098608 (Why is no real title available?)
- Intersection theorems with geometric consequences
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On the chromatic number of a space
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- The difference between consecutive primes. II
- The Mathematical Coloring Book
- The realization of distances within sets in Euclidean space
Cited in
(19)- Lower bounds for measurable chromatic numbers
- A lower bound for the one-chromatic number of a surface
- On a bound in extremal combinatorics
- Chromatic numbers of spheres
- A generalization of Kneser graphs
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- On lower bounds for the chromatic number of spheres
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- Counterexamples to Borsuk's conjecture with large girth
- On the chromatic numbers of low-dimensional spaces
- Lovász' theorem on the chromatic number of spheres revisited
- Orthogonal colorings of the sphere
- Coloring regions on a sphere to forbid the unit distance
- The distinguishing chromatic numbers of triangulations on the sphere
- Measurable colorings of \(\mathbb{S}^2_r\)
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- The surface of a sufficiently large sphere has chromatic number at most 7
- On the chromatic number of 2-dimensional spheres
This page was built for publication: On lower bounds for the chromatic number of sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892738)
