A short proof of w_1^n(Hom(C_{2r+1}, K_{n+2}))=0 for all n and a graph colouring theorem by Babson and Kozlov

Details A short proof of w_1^n(Hom(C_{2r+1}, K_{n+2}))=0 for all n and a graph colouring theorem by Babson and Kozlov A short proof of w_1^n(Hom(C_{2r+1}, K_{n+2}))=0 for all n and a graph colouring theorem by Babson and Kozlov

2005-07-17

arxiv.org/abs/math/0507346v4

Mathematics

Algebraic Topology

slight simplification of the proof, updated references

Scientific paper

We show that the n-th power of the first Stiefel-Whitney class of the Z_2-operation on the graph complex Hom(C_{2r+1},K_{n+2})$ is zero, confirming a conjecture by Babson and Kozlov. This proves the strong form of their graph colouring theorem, which they had only proven for odd n. Our proof is also considerably simpler than their proof of the weak form of the theorem, which is also known as the Lov\'asz conjecture.

Affiliated with

Also associated with

No associations

Rating

A short proof of w_1^n(Hom(C_{2r+1}, K_{n+2}))=0 for all n and a graph colouring theorem by Babson and Kozlov 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 A short proof of w_1^n(Hom(C_{2r+1}, K_{n+2}))=0 for all n and a graph colouring theorem by Babson and Kozlov, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A short proof of w_1^n(Hom(C_{2r+1}, K_{n+2}))=0 for all n and a graph colouring theorem by Babson and Kozlov will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-396700