On the chromatic numbers of 3-dimensional slices

MaRDI QIDQ6506377arXivFDO

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

Published in arXiv

Abstract: We prove that for an arbitrary $varepsilon>0$ holds [ chi (mathbb{R}^3 imes [0,varepsilon]^6) geq 10, ] where $chi(M)$ stands for the chromatic number of an (infinite) graph with the vertex set $M$ and the edge set consists of pairs of monochromatic points at the distance 1 apart.

This page was built for publication: On the 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 Q6506377)