Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions

DOI10.37236/11794zbMath1543.05046MaRDI QIDQ6574374

Danylo V. Radchenko, Andriy V. Bondarenko, Andrii Arman, Andriy Prymak

Publication date: 18 July 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

computer assistancesublattice coloring schemes

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational approaches to lattice packing and covering problems
• Multiregular point systems
• A 15-colouring of 3-space omitting distance one
• 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\)
• Complexity and algorithms for computing Voronoi cells of lattices
• From deep holes to free planes
• Research Problems in Discrete Geometry
• On the lattice packing--covering ratio of finite-dimensional normed spaces
• On Lower Bounds of the Density of Delone Sets and Holes in Sequences of Sphere Packings
• The Mathematical Coloring Book
• Finding the nearest point in A polytope
• On the chromatic number of a space
• The chromatic number of the plane is at least 5
• The realization of distances within sets in Euclidean space
• Simultaneous Packing and Covering in Euclidean Space
• A Note on Coverings and Packings

This page was built for publication: Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions