Volume 170, Number 1, 125-134, DOI: 10.1007/s11856-009-0023-z

A short proof of w1n (Hom(C2r+1, Kn+2)) = 0 for all n and A graph colouring theorem by Babson and Kozlov

Carsten Schultz

View Related Documents

Abstract

We show that the n-th power of the first Stiefel-Whitney class of the ℤ2-action on the graph complex Hom(C 2r+1, K n+2) is zero, confirming a conjecture by Babson and Kozlov. This yields a considerably simplified proof of their graph colouring theorem, which is also known as the Lovsz conjecture.
This research was supported by the Deutsche Forschungsgemeinschaft within the European graduate program “ Combinatorics, Geometry, and Computation” (No. GRK 588/2)

Fulltext Preview

Image of the first page of the fulltext document