Reduced chromatic graph cohomology

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper we give a new characterization of the h-vector of the chromatic polynomial of a graph. We introduce reduced chromatic cohomology of a graph and show that h_i are its Betti numbers. We then discuss various combinatorial properties of these cohomologies. In particular we prove that these cohomologies depend only on the matroid type of the graph and describe their relationship to the regular chromatic cohomologies.
11 pages, 1 figure

Keywords

Combinatorics, Geometric Topology, 05C15; 57M27

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/103804

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0510536
 http://arxiv.org/abs/math/0510536

Collections

arXiv