Colouring simplicial complexes via the Lechuga-Murillo's model

David Méndez

Published: 12 Jun 2020, Last Modified: 29 Apr 2026Applicable Algebra in Engineering, Communication and ComputingEveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Lechuga and 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.