Upper bounds on chromatic number of E^n in low dimensions

DOI10.37236/11794MaRDI QIDQ6574374zbMATH OpenFDO

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)

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) Combinatorial aspects of packing and covering (05B40) Lattice packing and covering (number-theoretic aspects) (11H31)

Recommendations

• On the chromatic numbers of low-dimensional spaces
• A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
• On the chromatic number of real and rational spaces
• An 18-colouring of 3-space omitting distance one

Cites work

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

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)