Chromatic numbers of spheres
From MaRDI portal
Publication:1783626
DOI10.1016/j.disc.2018.07.014zbMath1395.05062arXiv1711.03193OpenAlexW2963950710WikidataQ129365924 ScholiaQ129365924MaRDI QIDQ1783626
Publication date: 21 September 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.03193
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (5)
Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ On the chromatic number of 2-dimensional spheres ⋮ On a relation between packing and covering densities of convex bodies ⋮ Covering compact metric spaces greedily ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Weighted covering numbers of convex sets
- The chromatic number of \(\mathbb R^n\) with a set of forbidden distances
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic number of with an arbitrary norm
- On weighted covering numbers and the Levi-Hadwiger conjecture
- On lower bounds for the chromatic number of sphere
- The realization of distances in measurable subsets covering \(R^ n\).
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- On a Frankl-Rödl theorem and its geometric corollaries
- Two combinatorial covering theorems
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
- On the chromatic number of Euclidean space with two forbidden distances
- The density of sets avoiding distance 1 in Euclidean space
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- On the chromatic numbers of low-dimensional spaces
- On the chromatic number of a space with a forbidden regular simplex
- Approximating set multi-covers
- Borsuk's problem and the chromatic numbers of some metric spaces
- On some covering problems in geometry
- Coloring Distance Graphs and Graphs of Diameters
- A note on coverings
- The Mathematical Coloring Book
- On the chromatic number of a space
- Combinatorial Geometry and Coding Theory*
- Covering a sphere with spheres
- The realization of distances within sets in Euclidean space
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: Chromatic numbers of spheres
