Vertex colorings of simplicial complexes
classification
🧮 math.AT
math.CO
keywords
coloringprobleminvolvessimplexsimplicialtopologicalverticesabstract
read the original abstract
We define an (r,s)-coloring of an abstract simplicial complex to be a coloring using r colors of the vertices so that in any simplex at most s vertices have the same color. We translate the problem of finding an (r,s)-coloring of a given simplex to a topological problem and to a ring theoretic problem. The topological version involves vector bundles over Davis--Januszkiewicz spaces and the algebraic one involves factorizations in Stanley-Reisner rings.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.