Homology tests for graph colorings

Details Homology tests for graph colorings Homology tests for graph colorings

2006-07-28

arxiv.org/abs/math/0607750v1

Mathematics

Algebraic Topology

To appear in "Contemporary Mathematics"

Scientific paper

We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary Z_2-space has nontrivial homology with Z_2-coefficients in the dimension equal to its Stiefel-Whitney height. Actually, as a result we have a whole family of homology tests, one for each test graph. In general, these tests will give different answers, depending heavily on the choice of the test graph. We illustrate this phenomenon with some examples.

Affiliated with

Also associated with

No associations

Rating

Homology tests for graph colorings 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 Homology tests for graph colorings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homology tests for graph colorings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251402