On the chromatic number of a simplicial complex
Combinatorics
2019-06-03 v2
Abstract
In [Ho] A.J. Hoffman proved a lower bound on the chromatic number of a graph in the terms of the largest and the smallest eigenvalues of its adjacency matrix. In this paper, we prove a higher dimensional version of this result and give a lower bound on the chromatic number of a pure -dimensional simplicial complex in the terms of the spectra of the higher Laplacian operators.
Keywords
Cite
@article{arxiv.1306.4818,
title = {On the chromatic number of a simplicial complex},
author = {Konstantin Golubev},
journal= {arXiv preprint arXiv:1306.4818},
year = {2019}
}