Upper bounds on chromatic number of E^n in low dimensions
DOI10.37236/11794zbMATH Open1543.05046MaRDI QIDQ6574374FDOQ6574374
Authors: Andrii Arman, Andriy V. Bondarenko, A. V. Prymak, Danylo V. Radchenko 
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Coloring of graphs and hypergraphs (05C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Lattice packing and covering (number-theoretic aspects) (11H31)
Cites Work
- Research Problems in Discrete Geometry
- A Note on Coverings and Packings
- The Mathematical Coloring Book
- Title not available (Why is that?)
- On the chromatic number of a space
- The realization of distances within sets in Euclidean space
- Title not available (Why is that?)
- Finding the nearest point in A polytope
- A 15-colouring of 3-space omitting distance one
- Complexity and algorithms for computing Voronoi cells of lattices
- Title not available (Why is that?)
- From deep holes to free planes
- Simultaneous Packing and Covering in Euclidean Space
- Multiregular point systems
- On Lower Bounds of the Density of Delone Sets and Holes in Sequences of Sphere Packings
- Computational approaches to lattice packing and covering problems
- Title not available (Why is that?)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- The chromatic number of the plane is at least 5
- On the lattice packing--covering ratio of finite-dimensional normed spaces
- Title not available (Why is that?)
This page was built for publication: Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574374)
