A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
From MaRDI portal
Publication:2309559
DOI10.1016/j.dam.2019.05.020zbMath1435.05083arXiv1610.02846OpenAlexW2975897299WikidataQ114191514 ScholiaQ114191514MaRDI QIDQ2309559
Publication date: 1 April 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02846
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Real and complex geometry (51M99)
Related Items (9)
Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions ⋮ Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions ⋮ Max-norm Ramsey theory ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ On a relation between packing and covering densities of convex bodies ⋮ Covering planar sets ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ All finite sets are Ramsey in the maximum norm
Cites Work
- Unnamed Item
- On the chromatic number of with an arbitrary norm
- Covering the \(n\)-space by convex bodies and its chromatic number
- 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
- Chromatic numbers of spheres
- Two combinatorial covering theorems
- Exponentially Ramsey sets
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Counterexamples to Borsuk's conjecture with large girth
- On the chromatic numbers of low-dimensional spaces
- Borsuk's problem and the chromatic numbers of some metric spaces
- On some covering problems in geometry
- Coloring Distance Graphs and Graphs of Diameters
- Research Problems in Discrete Geometry
- The Mathematical Coloring Book
- On the chromatic number of a space
- The chromatic number of the plane is at least 5
- On the chromatic number of an infinitesimal plane layer
- On the Frankl–Rödl theorem
- The chromatic number of a space with the metric $ l_q$
- Covering space with convex bodies
- The realization of distances within sets in Euclidean space
- Simultaneous Packing and Covering in Euclidean Space
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
