On the chromatic numbers of spheres in \(\mathbb R^n\)

DOI10.1007/s00493-012-2709-9zbMath1265.05312arXiv1010.0384OpenAlexW2085448166MaRDI QIDQ452856

Andrei M. Raigorodskii

Publication date: 18 September 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.0384

zbMATH Keywords

chromatic numbergeometric graphlinear algebra boundlinear spaces of multivariate polynomials

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (40)

Strongly self-dual polytopes and distance graphs in the unit sphere ⋮ Lovász' theorem on the chromatic number of spheres revisited ⋮ 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 ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ 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 ⋮ Interview with Andrei Raigorodskii ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs ⋮ On the chromatic number of 2-dimensional spheres ⋮ New bounds for the chromatic number of a space with forbidden isosceles triangles ⋮ Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces ⋮ Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections ⋮ Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs ⋮ Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ 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 ⋮ ORTHOGONAL COLORINGS OF THE SPHERE ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces ⋮ Hamiltonian paths in distance graphs ⋮ Small Subgraphs in Random 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\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ 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 ⋮ On large subgraphs of a distance graph which have small chromatic number ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ 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

• Eine Bemerkung zur Konstruktion großer Primzahllücken
• Intersection theorems with geometric consequences
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• On a problem of Erdős concerning a 3-coloring of the unit sphere
• The Difference Between Consecutive Primes, II
• Borsuk's problem and the chromatic numbers of some metric spaces
• Research Problems in Discrete Geometry
• On the colouring of spheres embedded in $ \mathbb R^n$
• On Ramsey Type Problems in Combinatorial Geometry
• On the chromatic number of a space
• Covering a sphere with spheres
• The realization of distances within sets in Euclidean space
• The Difference between Consecutive Prime Numbers V
• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic numbers of spheres in \(\mathbb R^n\)