On the chromatic numbers of spheres in Euclidean spaces

DOI10.1134/S1064562410030117zbMath1205.52018OpenAlexW2018417717MaRDI QIDQ610564

Andrei M. Raigorodskii

Publication date: 8 December 2010

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

Full work available at URL: https://doi.org/10.1134/s1064562410030117

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10) Discrete geometry (52C99)

Related Items (22)

Independence numbers of random subgraphs of a distance graph ⋮ On computational complexity of length embeddability of graphs ⋮ On the number of edges in induced subgraphs of a special distance graph ⋮ Independence numbers of random subgraphs of distance graphs ⋮ A new estimate for the number of edges in induced subgraphs of a special distance graph ⋮ On the distance and multidistance graph embeddability problem ⋮ Diameters of random distance graphs ⋮ On lower bounds for the chromatic number of sphere ⋮ An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ New bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections ⋮ Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii ⋮ New estimates in the problem of the number of edges in a hypergraph with forbidden intersections ⋮ Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\) ⋮ Chromatic numbers of spheres ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ On lower bounds for the chromatic number of spheres ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs ⋮ Independence numbers and chromatic numbers of some distance graphs ⋮ New lower bounds for the chromatic number of a space with forbidden isosceles triangles

Cites Work

• On a problem of Erdős concerning a 3-coloring of the unit sphere
• On Ramsey Type Problems in Combinatorial Geometry
• The realization of distances within sets in Euclidean space

This page was built for publication: On the chromatic numbers of spheres in Euclidean spaces