On the chromatic numbers of spheres in R^n
From MaRDI portal
Publication:452856
DOI10.1007/S00493-012-2709-9zbMATH Open1265.05312arXiv1010.0384OpenAlexW2085448166MaRDI QIDQ452856FDOQ452856
Authors: Andrei M. Raigorodskii 
Publication date: 18 September 2012
Published in: Combinatorica (Search for Journal in Brave)
Abstract: In this paper, we obtain new asymptotic lower bounds for the chromatic numbers of spheres.
Full work available at URL: https://arxiv.org/abs/1010.0384
Recommendations
- Lovász' theorem on the chromatic number of spheres revisited
- On lower bounds for the chromatic number of sphere
- On the chromatic numbers of spheres in Euclidean spaces
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- scientific article; zbMATH DE number 3989376
Cites Work
- Research Problems in Discrete Geometry
- Intersection theorems with geometric consequences
- The difference between consecutive primes. II
- Borsuk's problem and the chromatic numbers of some metric spaces
- On the chromatic number of a space
- The realization of distances within sets in Euclidean space
- Title not available (Why is that?)
- On the colouring of spheres embedded in \(\mathbb R^n\)
- Eine Bemerkung zur Konstruktion großer Primzahllücken
- The Difference between Consecutive Prime Numbers V
- Covering a sphere with spheres
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- On a problem of Erdős concerning a 3-coloring of the unit sphere
- On Ramsey Type Problems in Combinatorial Geometry
- Title not available (Why is that?)
Cited In (47)
- Strongly self-dual polytopes and distance graphs in the unit sphere
- The distinguishing chromatic numbers of triangulations on the sphere
- On large subgraphs of a distance graph which have small chromatic number
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- On the stability of some Erdős-Ko-Rado type results
- Independence numbers and chromatic numbers of some distance graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On the chromatic numbers of spheres in Euclidean spaces
- On threshold probability for the stability of independent sets in distance graphs
- On the chromatic number of 2-dimensional spheres
- 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
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- Diameters of random distance graphs
- Independence numbers of random subgraphs of a distance graph
- Independence numbers of random subgraphs of distance graphs
- New upper bound for the chromatic number of a random subgraph of a distance graph
- Lovász' theorem on the chromatic number of spheres revisited
- Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
- Hamiltonian paths in distance graphs
- A generalization of Kneser graphs
- On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
- On the number of edges in induced subgraphs of a special distance graph
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- Chromatic numbers of spheres
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- 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
- On lower bounds for the chromatic number of sphere
- Small subgraphs in random distance graphs
- On the distance and multidistance graph embeddability problem
- Counterexamples to Borsuk's conjecture with large girth
- Orthogonal colorings of the sphere
- Saturation in Kneser graphs
- Generalized Borsuk graphs
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- Interview with Andrei Raigorodskii
- Note on decomposition of spheres in Hilbert spaces
- On lower bounds for the chromatic number of spheres
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color 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
- Estimate of the number of edges in special subgraphs of a distance graph
- On computational complexity of length embeddability of graphs
This page was built for publication: On the chromatic numbers of spheres in \(\mathbb R^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452856)
