Reduced chromatic graph cohomology

Details Reduced chromatic graph cohomology Reduced chromatic graph cohomology

2005-10-26

arxiv.org/abs/math/0510536v1

Mathematics

Combinatorics

11 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Reduced chromatic graph cohomology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reduced chromatic graph cohomology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced chromatic graph cohomology will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555653