On the chromatic number of with an arbitrary norm
From MaRDI portal
Publication:626862
DOI10.1016/j.disc.2010.12.005zbMath1235.05016MaRDI QIDQ626862
Publication date: 18 February 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.12.005
05A18: Partitions of sets
05C15: Coloring of graphs and hypergraphs
05B40: Combinatorial aspects of packing and covering
Related Items
New lower bound for the chromatic number of a rational space with one and two forbidden distances, New lower bounds for the chromatic number of a space with forbidden isosceles triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering the \(n\)-space by convex bodies and its chromatic number
- On the packing densities of superballs and other bodies
- On the Minkowski-Hlawka theorem
- Borsuk's problem and the chromatic numbers of some metric spaces
- Research Problems in Discrete Geometry
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- Covering space with convex bodies
- The realization of distances within sets in Euclidean space