paper

Chromatic Numbers of Simplicial Manifolds

arXiv:1503.08251

Abstract

Higher chromatic numbers of simplicial complexes naturally generalize the chromatic number of a graph. In any fixed dimension , the -chromatic number of -complexes can become arbitrarily large for [6,18]. In contrast, , and only little is known on for . A particular class of -complexes are triangulations of -manifolds. As a consequence of the Map Color Theorem for surfaces [29], the 2-chromatic number of any fixed surface is finite. However, by combining results from the literature, we will see that for surfaces becomes arbitrarily large with growing genus. The proof for this is via Steiner triple systems and is non-constructive. In particular, up to now, no explicit triangulations of surfaces with high were known. We show that orientable surfaces of genus at least 20 and non-orientable surfaces of genus at least 26 have a 2-chromatic number of at least 4. Via a projective Steiner triple systems, we construct an explicit triangulation of a non-orientable surface of genus 2542 and with face vector that has 2-chromatic number 5 or 6. We also give orientable examples with 2-chromatic numbers 5 and 6. For 3-dimensional manifolds, an iterated moment curve construction [18] along with embedding results [6] can be used to produce triangulations with arbitrarily large 2-chromatic number, but of tremendous size. Via a topological version of the geometric construction of [18], we obtain a rather small triangulation of the 3-dimensional sphere with face vector and 2-chromatic number 5.

22 pages, 11 figures, revised presentation