A Lower Bound on the Number of Colours Needed to Nicely Colour a Sphere

Abstract The Hadwiger–Nelson problem is about determining the chromatic number of the plane (CNP), defined as the minimum number of colours needed to colour the plane so that no two points of distance 1 have the same colour. In this paper we investigate a related problem for spheres and we use a few natural restrictions on the colouring. Thomassen showed that with these restrictions, the chromatic number of all manifolds satisfying certain properties (including the plane and all spheres with a large enough radius) is at least 7. We prove that with these restrictions, the chromatic number of any sphere with a large enough radius is at least 8. This also gives a new lower bound for the minimum colours needed for colouring the 3-dimensional space with the same restrictions.

Authors

Institutions

Publication Details

Journal
Discrete & Computational Geometry
Published
2025-07-26
DOI
https://doi.org/10.1007/s00454-025-00736-3
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Lower Bound on the Number of Colours Needed to Nicely Colour a Sphere

Péter Ágoston
Discrete & Computational Geometry
Limits and Structures in Graph Theory
article

A Lower Bound on the Number of Colours Needed to Nicely Colour a Sphere

Péter Ágoston
article en

Abstract

Abstract The Hadwiger–Nelson problem is about determining the chromatic number of the plane (CNP), defined as the minimum number of colours needed to colour the plane so that no two points of distance 1 have the same colour. In this paper we investigate a related problem for spheres and we use a few natural restrictions on the colouring. Thomassen showed that with these restrictions, the chromatic number of all manifolds satisfying certain properties (including the plane and all spheres with a large enough radius) is at least 7. We prove that with these restrictions, the chromatic number of any sphere with a large enough radius is at least 8. This also gives a new lower bound for the minimum colours needed for colouring the 3-dimensional space with the same restrictions.

Discrete & Computational Geometry
Eötvös Loránd University (HU), HUN-REN Alfréd Rényi Institute of Mathematics (HU)
European Commission, Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, National Research, Development and Innovation Office
Openalex Percentile: Top 75%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Lower Bound on the Number of Colours Needed to Nicely Colour a Sphere — Péter Ágoston · Discrete & Computational Geometry (2025) | TGRS Research Map | TGRS