On the chromatic number of with an arbitrary norm

DOI10.1016/j.disc.2010.12.005zbMath1235.05016MaRDI QIDQ626862

Andrey B. Kupavskii

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

zbMATH Keywords

covering; chromatic number; centrally symmetric convex body

Mathematics Subject Classification ID

05A18: Partitions of sets

05C15: Coloring of graphs and hypergraphs

05B40: Combinatorial aspects of packing and covering

Related Items

All finite sets are Ramsey in the maximum norm, On the chromatic numbers of small-dimensional Euclidean spaces, Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions, Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets, Chromatic numbers of spheres, Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size, On the chromatic numbers corresponding to exponentially Ramsey sets, Exponentially Ramsey sets, 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\), Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles, 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, On the chromatic numbers of low-dimensional spaces, Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions

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