Covering the \(n\)-space by convex bodies and its chromatic number

DOI10.1016/j.disc.2007.08.048zbMath1146.52012OpenAlexW2119945951MaRDI QIDQ941394

Zoltan Fueredi, Jeong-Hyun Kang

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.048

zbMATH Keywords

coveringconvex bodychromatic number of the unit-distance graphLovász local Lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (5)

Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ On the chromatic number of with an arbitrary norm ⋮ The chromatic number of \(\mathbb R^n\) with a set of forbidden distances ⋮ On some covering problems in geometry ⋮ 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
• The difference body of a convex body
• A note on coverings
• Volume Ratios and a Reverse Isoperimetric Inequality
• On the Best Constant for the Besicovitch Covering Theorem
• Covering space with convex bodies

This page was built for publication: Covering the \(n\)-space by convex bodies and its chromatic number