Colouring simplicial complexes via the Lechuga-Murillo's model
Colouring simplicial complexes via the Lechuga-Murillo's model
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.
Méndez, David
082b86ce-ba78-4519-9713-ff1a38f65c96
Méndez, David
082b86ce-ba78-4519-9713-ff1a38f65c96
Méndez, David
(2020)
Colouring simplicial complexes via the Lechuga-Murillo's model.
Applicable Algebra in Engineering, Communication and Computing.
(doi:10.1007/s00200-020-00440-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.
Text
Colouring simplicial complexes
- Version of Record
More information
Accepted/In Press date: 12 May 2020
e-pub ahead of print date: 12 June 2020
Additional Information:
Funding Information:
This work was supported by The Alan Turing Institute under the EPSRC grant EP/N510129/1. The author was partially supported by Ministerio de Economía y Competitividad (Spain) Grants Nos. MTM2016-79661-P and MTM2016-78647-P. Acknowledgements
Publisher Copyright:
© 2020, The Author(s).
Identifiers
Local EPrints ID: 441497
URI: http://eprints.soton.ac.uk/id/eprint/441497
ISSN: 0938-1279
PURE UUID: a13b0598-2512-4352-99fc-a41a4bc41635
Catalogue record
Date deposited: 16 Jun 2020 16:30
Last modified: 16 Mar 2024 08:11
Export record
Altmetrics
Contributors
Author:
David Méndez
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics