On lower bounds for the chromatic number of sphere

DOI10.1134/S1064562415040298zbMath1330.52021MaRDI QIDQ892738

Andrei M. Raigorodskii, Olga A. Kostina

Publication date: 12 November 2015

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

zbMATH Keywords

chromatic numberunit distance graph

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (7)

On a bound in extremal combinatorics ⋮ A generalization of Kneser graphs ⋮ Chromatic numbers of spheres ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational 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 ⋮ Counterexamples to Borsuk's conjecture with large girth

Cites Work

• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• On the chromatic numbers of spheres in Euclidean spaces
• Intersection theorems with geometric consequences
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
• The Difference Between Consecutive Primes, II
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• The Mathematical Coloring Book
• On the chromatic number of a space
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item

This page was built for publication: On lower bounds for the chromatic number of sphere