2000 character limit reached
Colouring simplicial complexes via the Lechuga-Murillo's model
Published 23 Oct 2016 in math.AT and math.CO | (1610.07174v2)
Abstract: L. Lechuga and A. Murillo showed that a non-oriented, simple, connected, finite graph $G$ is $k$-colourable if and only if a certain pure Sullivan algebra associated to $G$ and $k$ is not elliptic. In this paper, we extend this result to simplicial complexes by means of several notions of colourings of these objects.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
