On chromatic numbers of 3-dimensional slices

DOI10.1007/S10958-026-08361-YMaRDI QIDQ7268155zbMATH OpenFDO

Authors Danila Cherkashin, A. Ya Belov, G. A. Strukov, Vsevolod Aleksandrovich Voronov

Publication date 17 June 2026

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10958-026-08361-Y

zbMATH Keywords

Nelson-Hadwiger problem

Mathematics Subject Classification ID

Designs and configurations (05Bxx) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Extremal combinatorics (05Dxx)

Cites work

• -unit distance graphs
• A 15-colouring of 3-space omitting distance one
• Computing small unit-distance graphs with chromatic number 5
• Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
• Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
• scientific article; zbMATH DE number 1406330 (Why is no real title available?)
• scientific article; zbMATH DE number 2209739 (Why is no real title available?)
• On the chromatic number of an infinitesimal plane layer
• On the space chromatic number
• The chromatic number of the plane is at least 5
• The chromatic number of the plane is at least 5 -- a human-veriviable proof
• The chromatic number of the plane is at least 5: a new proof
• The realization of distances within sets in Euclidean space

This page was built for publication: On chromatic numbers of 3-dimensional slices

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