On the chromatic numbers of small-dimensional Euclidean spaces

From MaRDI portal
Publication:5891225

DOI10.1016/j.endm.2009.07.072zbMath1273.05073arXiv1512.03472OpenAlexW2962871181MaRDI QIDQ5891225

Andrey B. Kupavskii, Andrei M. Raigorodskii, Danila Cherkashin, Anatoly Kulikov

Publication date: 10 October 2013

Published in: Discrete Applied Mathematics, Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.03472




Related Items (28)

On the chromatic number of an infinitesimal plane layerConstructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheresColoring distance graphs on the planeOn a Frankl-Wilson theoremColoring general Kneser graphs and hypergraphs via high-discrepancy hypergraphsChromatic numbers of some distance graphsEstimate of the number of edges in special subgraphs of a distance graphA generalization of Kneser graphsIndependence numbers of Johnson-type graphsOn the chromatic numbers corresponding to exponentially Ramsey setsOn the chromatic numbers of some distance graphsOn the Frankl–Rödl theoremOn the chromatic numbers of small-dimensional Euclidean spacesChromatic numbers of spheresExponentially Ramsey setsDistance graphs with large chromatic number and without cliques of given size in the rational spaceChromatic numbers of distance graphs without short odd cycles in rational spacesBounds on Borsuk numbers in distance graphs of a special typeChromatic numbers of Kneser-type graphsOn the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean spaceOn the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)On lower bounds for the chromatic number of spheresClique chromatic numbers of intersection graphsA remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)On the chromatic number of random subgraphs of a certain distance graphCounterexamples to Borsuk's conjecture with large girthAll finite sets are Ramsey in the maximum norm


Uses Software


Cites Work


This page was built for publication: On the chromatic numbers of small-dimensional Euclidean spaces