On the chromatic number of 2-dimensional spheres

DOI10.1007/S00454-023-00483-3arXiv2203.08666OpenAlexW4323825471MaRDI QIDQ6151024FDOQ6151024

Vsevolod Aleksandrovich Voronov, Danila Cherkashin

Publication date: 9 February 2024

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

Abstract: In 1976 Simmons conjectured that every coloring of a 2-dimensional sphere of radius strictly greater than $1/2$ in three colors has a couple of monochromatic points at the distance 1 apart. We prove this conjecture.

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

zbMATH Keywords

implicit function theoremBorsuk-Ulam theoremunit distance graphs

Mathematics Subject Classification ID

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

Cites Work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151024)