A 15-colouring of 3-space omitting distance one
From MaRDI portal
Publication:1849913
DOI10.1016/S0012-365X(01)00183-2zbMath1007.05052OpenAlexW4212942800WikidataQ56610704 ScholiaQ56610704MaRDI QIDQ1849913
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00183-2
Coloring of graphs and hypergraphs (05C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)
Related Items
On large subgraphs with small chromatic numbers contained in distance graphs ⋮ On configurations of solid balls in 3-space: chromatic numbers and knotted cycles ⋮ On embedding of finite distance graphs with large chromatic number in random graphs ⋮ On the chromatic numbers of rational spaces ⋮ On rainbow isosceles \(n\)-simplexes ⋮ On the chromatic number of an infinitesimal plane layer ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ On the Chromatic Numbers of and with Intervals of Forbidden Distances ⋮ On the chromatic number of 2-dimensional spheres ⋮ On distance subgraphs of graphs in spaces of lower dimensions ⋮ A result in asymmetric Euclidean Ramsey theory ⋮ On the chromatic number of \(\mathbb R^4\) ⋮ Colorings of spaces, and random graphs ⋮ Embeddability of finite distance graphs with a large chromatic number in random graphs ⋮ Distance graphs with large chromatic numbers and small clique numbers ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ On the chromatic number of plane tilings ⋮ Axiom of choice and chromatic number of \(R^n\) ⋮ On a series of Ramsey-type problems in combinatorial geometry ⋮ The Hadwiger–Nelson Problem ⋮ Small clique and large chromatic number ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ On large subgraphs of a distance graph which have small chromatic number
