On lower bounds for the chromatic number of spheres

DOI10.1134/S0001434619010036zbMath1418.05065OpenAlexW2937924169MaRDI QIDQ2313602

Olga A. Kostina

Publication date: 19 July 2019

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

chromatic number of spheresdistance graphsNelson-Hadwiger problemFrankl-Wilson theoremlinear-algebraic method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Infinite graphs (05C63)

Related Items (9)

Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ On a Frankl-Wilson theorem ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ On the chromatic number of 2-dimensional spheres ⋮ Modularity of some distance graphs ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ Modularity of some distance graphs ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lovász' theorem on the chromatic number of spheres revisited
• 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
• On a problem of Erdős concerning a 3-coloring of the unit sphere
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
• 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 the chromatic numbers of low-dimensional spaces
• Improvements of the Frankl-Rödl theorem and geometric consequences
• 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
• Combinatorial Geometry and Coding Theory*
• Covering a sphere with spheres
• The realization of distances within sets in Euclidean space
• On the chromatic numbers of small-dimensional Euclidean spaces

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