An 18-colouring of 3-space omitting distance one

DOI10.1016/S0012-365X(96)00309-3zbMATH Open0879.05030MaRDI QIDQ1363671FDOQ1363671

D. Coulson

Publication date: 12 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• A 15-colouring of 3-space omitting distance one
• The surface of a sufficiently large sphere has chromatic number at most 7
• On the chromatic number of plane tilings
• A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
• On the space chromatic number
• scientific article; zbMATH DE number 653246
• scientific article; zbMATH DE number 2042228
• On the Chromatic Numbers of and with Intervals of Forbidden Distances
• The chromatic number of the plane: the bounded case
• The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs

zbMATH Keywords

latticechromatic numberVoronoi regionunit distancecoloration

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Cites Work

• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• Title not available (Why is that?)
• Bounds on the measurable chromatic number of \({\mathbb{R}}\)
• Title not available (Why is that?)
• Distances realized by sets covering the plane
• Title not available (Why is that?)

Cited In (3)

• Bounds on the measurable chromatic number of \({\mathbb{R}}\)
• Title not available (Why is that?)
• A 15-colouring of 3-space omitting distance one

This page was built for publication: An 18-colouring of 3-space omitting distance one

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