arXiv Analytics

Sign in

arXiv:1408.2002 [math.CO]AbstractReferencesReviewsResources

On the Chromatic Number of $\mathbb{R}^n$ for Small Values of $n$

Geoffrey Exoo, Dan Ismailescu

Published 2014-08-09Version 1

The lower bound for the chromatic number of $\mathbb{R}^n$ is improved for $n = 6, 7, 10, 11, 12, 13 \mbox{ and } 14$.

Categories: math.CO, math.MG
Subjects: 05C15, 52C10
Related articles: Most relevant | Search more
arXiv:math/0606632 [math.CO] (Published 2006-06-25)
New upper bounds on the chromatic number of a graph
arXiv:math/0208072 [math.CO] (Published 2002-08-09, updated 2003-11-24)
Topological lower bounds for the chromatic number: A hierarchy
arXiv:1407.8035 [math.CO] (Published 2014-07-30, updated 2015-11-30)
On Chromatic Number and Minimum Cut

Links

Toolbox