38 research outputs found

    Chromatic Numbers of Simplicial Manifolds

    Full text link
    Higher chromatic numbers χs\chi_s of simplicial complexes naturally generalize the chromatic number χ1\chi_1 of a graph. In any fixed dimension dd, the ss-chromatic number χs\chi_s of dd-complexes can become arbitrarily large for s≤⌈d/2⌉s\leq\lceil d/2\rceil [6,18]. In contrast, χd+1=1\chi_{d+1}=1, and only little is known on χs\chi_s for ⌈d/2⌉<s≤d\lceil d/2\rceil<s\leq d. A particular class of dd-complexes are triangulations of dd-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 χ2\chi_2 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 χ2\chi_2 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 f=(127,8001,5334)f=(127,8001,5334) 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 S3S^3 with face vector f=(167,1579,2824,1412)f=(167,1579,2824,1412) and 2-chromatic number 5.Comment: 22 pages, 11 figures, revised presentatio

    European Journal of Combinatorics Index, Volume 26

    Get PDF

    The fine intersection problem for Steiner triple systems

    Full text link
    The intersection of two Steiner triple systems (X,A) and (X,B) is the set A intersect B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that there exist two Steiner triple systems of order v whose intersection has n blocks over m points. We show that for v = 1 or 3 (mod 6), |I(v)| = Omega(v^3), where previous results only imply that |I(v)| = Omega(v^2).Comment: 9 page
    corecore