On the chromatic number of 2-dimensional spheres

DOI10.1007/s00454-023-00483-3arXiv2203.08666OpenAlexW4323825471MaRDI QIDQ6151024

Vsevolod Aleksandrovich Voronov, Danila Cherkashin

Publication date: 9 February 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

Borsuk-Ulam theoremimplicit function theoremunit distance graphs

Mathematics Subject Classification ID

Distance geometry (51K99) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• On the chromatic numbers of spheres in \(\mathbb R^n\)
• Chromatic numbers of spheres
• A 15-colouring of 3-space omitting distance one
• On lower bounds for the chromatic number of spheres
• Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
• On the colouring of spheres embedded in $ \mathbb R^n$
• Measurable Chromatic Number of Spheres
• The Mathematical Coloring Book
• The chromatic number of the plane is at least 5
• On the chromatic number of an infinitesimal plane layer
• The surface of a sufficiently large sphere has chromatic number at most 7
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic number of 2-dimensional spheres