Chromatic numbers of spheres
Copyright policy )Chromatic numbers of spheres
The chromatic number of a subset of Euclidean space is the minimal number of colors sufficient for coloring all points of this subset in such a way that any two points at the distance 1 have different colors. We give new upper bounds for chromatic numbers of spheres.
- University of Fribourg Switzerland
- Moscow Institute of Physics and Technology Russian Federation
Distance in graphs, Metric Geometry (math.MG), geometric covering, Coloring of graphs and hypergraphs, Mathematics - Metric Geometry, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), chromatic number, FOS: Mathematics, info:eu-repo/classification/udc/51, Mathematics - Combinatorics, Combinatorics (math.CO)
Distance in graphs, Metric Geometry (math.MG), geometric covering, Coloring of graphs and hypergraphs, Mathematics - Metric Geometry, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), chromatic number, FOS: Mathematics, info:eu-repo/classification/udc/51, Mathematics - Combinatorics, Combinatorics (math.CO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!